Base | Representation |
---|---|
bin | 10111001100010011000000… |
… | …011001010111010111111100 |
3 | 111101011010010010102221201012 |
4 | 113030103000121113113330 |
5 | 101332132211433021340 |
6 | 1000534112035334352 |
7 | 30325156562043443 |
oct | 2714230031272774 |
9 | 441133103387635 |
10 | 102000111220220 |
11 | 2a5560057123a4 |
12 | b53437aa513b8 |
13 | 44bb75274bba5 |
14 | 1b28b90373d5a |
15 | bbd3cc41b565 |
hex | 5cc4c06575fc |
102000111220220 has 24 divisors (see below), whose sum is σ = 214218571544208. Its totient is φ = 40796551539200.
The previous prime is 102000111220207. The next prime is 102000111220243. The reversal of 102000111220220 is 22022111000201.
It is a junction number, because it is equal to n+sod(n) for n = 102000111220195 and 102000111220204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218069846 + ... + 218537085.
It is an arithmetic number, because the mean of its divisors is an integer number (8925773814342).
Almost surely, 2102000111220220 is an apocalyptic number.
102000111220220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102000111220220 is an abundant number, since it is smaller than the sum of its proper divisors (112218460323988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000111220220 is a wasteful number, since it uses less digits than its factorization.
102000111220220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436618621 (or 436618619 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102000111220220 its reverse (22022111000201), we get a palindrome (124022222220421).
The spelling of 102000111220220 in words is "one hundred two trillion, one hundred eleven million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •