Base | Representation |
---|---|
bin | 10111001111011111111000… |
… | …110000101110111000011100 |
3 | 111101221010221112112010022120 |
4 | 113033133320300232320130 |
5 | 101344233231122431022 |
6 | 1001223133222542540 |
7 | 30350105242404342 |
oct | 2717377060567034 |
9 | 441833845463276 |
10 | 102220100202012 |
11 | 2a630334767461 |
12 | b56ab34897a50 |
13 | 4506411088830 |
14 | 1b3569d0ad992 |
15 | bc3ea5681d5c |
hex | 5cf7f8c2ee1c |
102220100202012 has 96 divisors (see below), whose sum is σ = 261792095846400. Its totient is φ = 30854067374592.
The previous prime is 102220100201993. The next prime is 102220100202023. The reversal of 102220100202012 is 210202001022201.
It is a junction number, because it is equal to n+sod(n) for n = 102220100201982 and 102220100202000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27222712 + ... + 30749247.
It is an arithmetic number, because the mean of its divisors is an integer number (2727000998400).
Almost surely, 2102220100202012 is an apocalyptic number.
102220100202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102220100202012 is an abundant number, since it is smaller than the sum of its proper divisors (159571995644388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102220100202012 is a wasteful number, since it uses less digits than its factorization.
102220100202012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57972195 (or 57972193 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102220100202012 its reverse (210202001022201), we get a palindrome (312422101224213).
The spelling of 102220100202012 in words is "one hundred two trillion, two hundred twenty billion, one hundred million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •