Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …010001011001001100111010 |
3 | 111101111200110121220110001210 |
4 | 113031300032101121030322 |
5 | 101340302203203014320 |
6 | 1001052104004223550 |
7 | 30335332120456530 |
oct | 2715601621311472 |
9 | 441450417813053 |
10 | 102100202001210 |
11 | 2a5944a8312606 |
12 | b54b85309abb6 |
13 | 44c8013cc4b9a |
14 | 1b2d9674a6150 |
15 | bc0cd95d90e0 |
hex | 5cdc0e45933a |
102100202001210 has 64 divisors (see below), whose sum is σ = 286004699615232. Its totient is φ = 22840653089856.
The previous prime is 102100202001209. The next prime is 102100202001241. The reversal of 102100202001210 is 12100202001201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5172239472 + ... + 5172259211.
It is an arithmetic number, because the mean of its divisors is an integer number (4468823431488).
Almost surely, 2102100202001210 is an apocalyptic number.
102100202001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100202001210 is an abundant number, since it is smaller than the sum of its proper divisors (183904497614022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100202001210 is a wasteful number, since it uses less digits than its factorization.
102100202001210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10344498747.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102100202001210 its reverse (12100202001201), we get a palindrome (114200404002411).
Subtracting from 102100202001210 its reverse (12100202001201), we obtain a palindrome (90000000000009).
The spelling of 102100202001210 in words is "one hundred two trillion, one hundred billion, two hundred two million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •