Base | Representation |
---|---|
bin | 10100011100110010101… |
… | …011110001110111110101 |
3 | 11222100100002121120202101 |
4 | 110130302223301313311 |
5 | 141011030442034221 |
6 | 2553331003342101 |
7 | 203346521242504 |
oct | 24346253616765 |
9 | 4870302546671 |
10 | 1405304643061 |
11 | 4a1a93920120 |
12 | 1a8435821931 |
13 | a269a8caa17 |
14 | 4c034d2c83b |
15 | 2684dbe0d91 |
hex | 14732af1df5 |
1405304643061 has 16 divisors (see below), whose sum is σ = 1569654079488. Its totient is φ = 1247089964400.
The previous prime is 1405304643047. The next prime is 1405304643163. The reversal of 1405304643061 is 1603464035041.
It is a cyclic number.
It is not a de Polignac number, because 1405304643061 - 219 = 1405304118773 is a prime.
It is a super-2 number, since 2×14053046430612 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1405304643061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1405304643361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102645 + ... + 1679626.
It is an arithmetic number, because the mean of its divisors is an integer number (98103379968).
Almost surely, 21405304643061 is an apocalyptic number.
1405304643061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1405304643061 is a deficient number, since it is larger than the sum of its proper divisors (164349436427).
1405304643061 is a wasteful number, since it uses less digits than its factorization.
1405304643061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1783992.
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 1405304643061 in words is "one trillion, four hundred five billion, three hundred four million, six hundred forty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •