Base | Representation |
---|---|
bin | 10111001100100111100110… |
… | …001111011110110101001100 |
3 | 111101020020011222220010202020 |
4 | 113030213212033132311030 |
5 | 101333013002034000022 |
6 | 1000552210012530140 |
7 | 30326601513056025 |
oct | 2714474617366514 |
9 | 441206158803666 |
10 | 102022221000012 |
11 | 2a56442104a185 |
12 | b53870b480950 |
13 | 44c0867259c21 |
14 | 1b29c8a92dc4c |
15 | bbdc734d235c |
hex | 5cc9e63ded4c |
102022221000012 has 24 divisors (see below), whose sum is σ = 250580893684800. Its totient is φ = 32217543473616.
The previous prime is 102022220999989. The next prime is 102022221000061. The reversal of 102022221000012 is 210000122220201.
It is a junction number, because it is equal to n+sod(n) for n = 102022220999955 and 102022221000000.
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, 223732940562 + ... + 223732941017.
It is an arithmetic number, because the mean of its divisors is an integer number (10440870570200).
Almost surely, 2102022221000012 is an apocalyptic number.
102022221000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102022221000012 is an abundant number, since it is smaller than the sum of its proper divisors (148558672684788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022221000012 is a wasteful number, since it uses less digits than its factorization.
102022221000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447465881605 (or 447465881603 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102022221000012 its reverse (210000122220201), we get a palindrome (312022343220213).
The spelling of 102022221000012 in words is "one hundred two trillion, twenty-two billion, two hundred twenty-one million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •