Base | Representation |
---|---|
bin | 10111001100100101101110… |
… | …011000111110001110110000 |
3 | 111101020000222212021000212112 |
4 | 113030211232120332032300 |
5 | 101332444342304101000 |
6 | 1000551234302544452 |
7 | 30326500625534330 |
oct | 2714455630761660 |
9 | 441200885230775 |
10 | 102020210222000 |
11 | 2a56358a010974 |
12 | b538249b98128 |
13 | 44c06067aab55 |
14 | 1b29b3986b0c0 |
15 | bbdba6be1235 |
hex | 5cc96e63e3b0 |
102020210222000 has 160 divisors (see below), whose sum is σ = 294183197927424. Its totient is φ = 33457559520000.
The previous prime is 102020210221999. The next prime is 102020210222041. The reversal of 102020210222000 is 222012020201.
102020210222000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
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, 158094476 + ... + 158738475.
Almost surely, 2102020210222000 is an apocalyptic number.
102020210222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102020210222000 is an abundant number, since it is smaller than the sum of its proper divisors (192162987705424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020210222000 is a wasteful number, since it uses less digits than its factorization.
102020210222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316833004 (or 316832988 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 102020210222000 its reverse (222012020201), we get a palindrome (102242222242201).
The spelling of 102020210222000 in words is "one hundred two trillion, twenty billion, two hundred ten million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •