Base | Representation |
---|---|
bin | 10111001101110010000110… |
… | …000001111101001000100000 |
3 | 111101111212122122121100002112 |
4 | 113031302012001331020200 |
5 | 101340320312033020000 |
6 | 1001053035220534452 |
7 | 30335432655525335 |
oct | 2715620601751040 |
9 | 441455578540075 |
10 | 102102211220000 |
11 | 2a595339486402 |
12 | b550113b51428 |
13 | 44c8274349344 |
14 | 1b2dab828098c |
15 | bc0da5bbd235 |
hex | 5cdc8607d220 |
102102211220000 has 120 divisors (see below), whose sum is σ = 251871205614336. Its totient is φ = 40729598496000.
The previous prime is 102102211219961. The next prime is 102102211220021. The reversal of 102102211220000 is 22112201201.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 384809 + ... + 14295191.
Almost surely, 2102102211220000 is an apocalyptic number.
102102211220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102102211220000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125935602807168).
102102211220000 is an abundant number, since it is smaller than the sum of its proper divisors (149768994394336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102211220000 is an equidigital number, since it uses as much as digits as its factorization.
102102211220000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13910780 (or 13910757 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102102211220000 its reverse (22112201201), we get a palindrome (102124323421201).
The spelling of 102102211220000 in words is "one hundred two trillion, one hundred two billion, two hundred eleven million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •