Base | Representation |
---|---|
bin | 10111001100011110001011… |
… | …000110111100110011000010 |
3 | 111101012021001210101212111120 |
4 | 113030132023012330303002 |
5 | 101332331241114232320 |
6 | 1000543413541453110 |
7 | 30326062662623166 |
oct | 2714361306746302 |
9 | 441167053355446 |
10 | 102012102102210 |
11 | 2a5600a9206523 |
12 | b536766711196 |
13 | 44bc913a40431 |
14 | 1b295aaa9aca6 |
15 | bbd87ee8a440 |
hex | 5cc78b1bccc2 |
102012102102210 has 16 divisors (see below), whose sum is σ = 244829045045376. Its totient is φ = 27203227227248.
The previous prime is 102012102102139. The next prime is 102012102102233. The reversal of 102012102102210 is 12201201210201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 102012102102210.
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, 1700201701674 + ... + 1700201701733.
It is an arithmetic number, because the mean of its divisors is an integer number (15301815315336).
Almost surely, 2102012102102210 is an apocalyptic number.
102012102102210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102012102102210 is an abundant number, since it is smaller than the sum of its proper divisors (142816942943166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102012102102210 is a wasteful number, since it uses less digits than its factorization.
102012102102210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3400403403417.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102012102102210 its reverse (12201201210201), we get a palindrome (114213303312411).
The spelling of 102012102102210 in words is "one hundred two trillion, twelve billion, one hundred two million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •