Base | Representation |
---|---|
bin | 10000110000111001001… |
… | …101010011110011001101 |
3 | 11002010112121222121212201 |
4 | 100300321031103303031 |
5 | 122333304310304423 |
6 | 2241120534201501 |
7 | 146141623102510 |
oct | 20607115236315 |
9 | 4063477877781 |
10 | 1152011025613 |
11 | 404624211388 |
12 | 1673261b3291 |
13 | 84832382986 |
14 | 3da86d22d77 |
15 | 1ee76b852ad |
hex | 10c39353ccd |
1152011025613 has 64 divisors (see below), whose sum is σ = 1389731696640. Its totient is φ = 934574860800.
The previous prime is 1152011025553. The next prime is 1152011025643. The reversal of 1152011025613 is 3165201102511.
It is a de Polignac number, because none of the positive numbers 2k-1152011025613 is a prime.
It is a super-2 number, since 2×11520110256132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152011025643) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 468486378 + ... + 468488836.
It is an arithmetic number, because the mean of its divisors is an integer number (21714557760).
Almost surely, 21152011025613 is an apocalyptic number.
It is an amenable number.
1152011025613 is a deficient number, since it is larger than the sum of its proper divisors (237720671027).
1152011025613 is a wasteful number, since it uses less digits than its factorization.
1152011025613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2938.
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 1152011025613 in words is "one trillion, one hundred fifty-two billion, eleven million, twenty-five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •