Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …001101010000001011101010 |
3 | 111101112201101201001111212020 |
4 | 113031322103031100023222 |
5 | 101340441333142020020 |
6 | 1001101053411125310 |
7 | 30336164215015116 |
oct | 2715722315201352 |
9 | 441481351044766 |
10 | 102111022220010 |
11 | 2a5990500180a1 |
12 | b5519728a3836 |
13 | 44c90498c410b |
14 | 1b302b2538746 |
15 | bc121e4b4c40 |
hex | 5cde933502ea |
102111022220010 has 32 divisors (see below), whose sum is σ = 245066849161920. Its totient is φ = 27229561943808.
The previous prime is 102111022219963. The next prime is 102111022220029. The reversal of 102111022220010 is 10022220111201.
102111022220010 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18939369 + ... + 23725971.
It is an arithmetic number, because the mean of its divisors is an integer number (7658339036310).
Almost surely, 2102111022220010 is an apocalyptic number.
102111022220010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111022220010 is an abundant number, since it is smaller than the sum of its proper divisors (142955826941910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111022220010 is a wasteful number, since it uses less digits than its factorization.
102111022220010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5497702.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102111022220010 its reverse (10022220111201), we get a palindrome (112133242331211).
The spelling of 102111022220010 in words is "one hundred two trillion, one hundred eleven billion, twenty-two million, two hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •