Base | Representation |
---|---|
bin | 10111001111011001010010… |
… | …001010001001001111011010 |
3 | 111101220110122102020200110120 |
4 | 113033121102022021033122 |
5 | 101344124221041214320 |
6 | 1001220001505254110 |
7 | 30346434450502461 |
oct | 2717312212111732 |
9 | 441813572220416 |
10 | 102213010101210 |
11 | 2a628326572818 |
12 | b569696334336 |
13 | 45058511c6b08 |
14 | 1b351c95bb9d8 |
15 | bc3bdcebb440 |
hex | 5cf6522893da |
102213010101210 has 64 divisors (see below), whose sum is σ = 258224296809600. Its totient is φ = 25822038580992.
The previous prime is 102213010101199. The next prime is 102213010101271. The reversal of 102213010101210 is 12101010312201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102213010101210.
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, 83885652 + ... + 85095408.
It is an arithmetic number, because the mean of its divisors is an integer number (4034754637650).
Almost surely, 2102213010101210 is an apocalyptic number.
102213010101210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102213010101210 is an abundant number, since it is smaller than the sum of its proper divisors (156011286708390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102213010101210 is a wasteful number, since it uses less digits than its factorization.
102213010101210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1358015.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 102213010101210 its reverse (12101010312201), we get a palindrome (114314020413411).
The spelling of 102213010101210 in words is "one hundred two trillion, two hundred thirteen billion, ten million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •