Base | Representation |
---|---|
bin | 10111001111001111000001… |
… | …111110100001011111100000 |
3 | 111101212102020012001121121012 |
4 | 113033033001332201133200 |
5 | 101343434144301413440 |
6 | 1001210541242320052 |
7 | 30345564602421032 |
oct | 2717170176413740 |
9 | 441772205047535 |
10 | 102202001201120 |
11 | 2a623697306187 |
12 | b5675234b9028 |
13 | 45047b84a4452 |
14 | 1b34863471c52 |
15 | bc379676ee65 |
hex | 5cf3c1fa17e0 |
102202001201120 has 48 divisors (see below), whose sum is σ = 241459997602320. Its totient is φ = 40879484964864.
The previous prime is 102202001201107. The next prime is 102202001201171. The reversal of 102202001201120 is 21102100202201.
It is a junction number, because it is equal to n+sod(n) for n = 102202001201095 and 102202001201104.
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, 5282225 + ... + 15241584.
It is an arithmetic number, because the mean of its divisors is an integer number (5030416616715).
Almost surely, 2102202001201120 is an apocalyptic number.
102202001201120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102202001201120 is an abundant number, since it is smaller than the sum of its proper divisors (139257996401200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102202001201120 is a wasteful number, since it uses less digits than its factorization.
102202001201120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20554947 (or 20554939 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102202001201120 its reverse (21102100202201), we get a palindrome (123304101403321).
The spelling of 102202001201120 in words is "one hundred two trillion, two hundred two billion, one million, two hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •