Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …011000111110000110000010 |
3 | 111101120120120110101222200211 |
4 | 113032002222120332012002 |
5 | 101341113230240232320 |
6 | 1001105140355504334 |
7 | 30336632553163210 |
oct | 2716025230760602 |
9 | 441516513358624 |
10 | 102120001102210 |
11 | 2a5a19383a51a3 |
12 | b5536598b80aa |
13 | 44c9b4ab8c270 |
14 | 1b308c4c13cb0 |
15 | bc15978be55a |
hex | 5ce0aa63e182 |
102120001102210 has 64 divisors (see below), whose sum is σ = 227007213334272. Its totient is φ = 32208992199936.
The previous prime is 102120001102199. The next prime is 102120001102247. The reversal of 102120001102210 is 12201100021201.
It is a super-2 number, since 2×1021200011022102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
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, 191234704 + ... + 191767963.
It is an arithmetic number, because the mean of its divisors is an integer number (3546987708348).
Almost surely, 2102120001102210 is an apocalyptic number.
102120001102210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102120001102210 is an abundant number, since it is smaller than the sum of its proper divisors (124887212232062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102120001102210 is a wasteful number, since it uses less digits than its factorization.
102120001102210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383002987.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102120001102210 its reverse (12201100021201), we get a palindrome (114321101123411).
The spelling of 102120001102210 in words is "one hundred two trillion, one hundred twenty billion, one million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •