Base | Representation |
---|---|
bin | 10111001100100111100110… |
… | …111001111001111100010110 |
3 | 111101020020012202211011000202 |
4 | 113030213212321321330112 |
5 | 101333013012410333420 |
6 | 1000552211051140502 |
7 | 30326602006435040 |
oct | 2714474671717426 |
9 | 441206182734022 |
10 | 102022232121110 |
11 | 2a564427355674 |
12 | b538713144732 |
13 | 44c0869651b62 |
14 | 1b29c8c1c6a90 |
15 | bbdc7447c575 |
hex | 5cc9e6e79f16 |
102022232121110 has 192 divisors, whose sum is σ = 228678027866496. Its totient is φ = 31980293529600.
The previous prime is 102022232121107. The next prime is 102022232121151. The reversal of 102022232121110 is 11121232220201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 643297784 + ... + 643456356.
It is an arithmetic number, because the mean of its divisors is an integer number (1191031395138).
Almost surely, 2102022232121110 is an apocalyptic number.
102022232121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102022232121110 is an abundant number, since it is smaller than the sum of its proper divisors (126655795745386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022232121110 is a wasteful number, since it uses less digits than its factorization.
102022232121110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158859 (or 158758 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102022232121110 its reverse (11121232220201), we get a palindrome (113143464341311).
Subtracting from 102022232121110 its reverse (11121232220201), we obtain a palindrome (90900999900909).
The spelling of 102022232121110 in words is "one hundred two trillion, twenty-two billion, two hundred thirty-two million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •