Base | Representation |
---|---|
bin | 110111111000010101… |
… | …1010101101111111111 |
3 | 102110202010221201212000 |
4 | 1233300223111233333 |
5 | 3431231003310421 |
6 | 131043403313343 |
7 | 11445522153534 |
oct | 1576053255777 |
9 | 373663851760 |
10 | 120002010111 |
11 | 46990008375 |
12 | 1b31051b853 |
13 | b41573c299 |
14 | 5b4570ad8b |
15 | 31c5251226 |
hex | 1bf0ad5bff |
120002010111 has 32 divisors (see below), whose sum is σ = 188171692800. Its totient is φ = 75371951520.
The previous prime is 120002010109. The next prime is 120002010119. The reversal of 120002010111 is 111010200021.
It is a happy number.
It is not a de Polignac number, because 120002010111 - 21 = 120002010109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 120002010093 and 120002010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002010119) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 553341 + ... + 739046.
It is an arithmetic number, because the mean of its divisors is an integer number (5880365400).
Almost surely, 2120002010111 is an apocalyptic number.
120002010111 is a deficient number, since it is larger than the sum of its proper divisors (68169682689).
120002010111 is a wasteful number, since it uses less digits than its factorization.
120002010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1292596 (or 1292590 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 120002010111 its reverse (111010200021), we get a palindrome (231012210132).
The spelling of 120002010111 in words is "one hundred twenty billion, two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •