Base | Representation |
---|---|
bin | 10110110010010000000001… |
… | …011111100011111100111011 |
3 | 111010211000001021110120110211 |
4 | 112302100001133203330323 |
5 | 101113320443203014321 |
6 | 553043533053051551 |
7 | 30051643136522101 |
oct | 2662200137437473 |
9 | 433730037416424 |
10 | 100210202001211 |
11 | 29a259a9611935 |
12 | b2a54a9a86bb7 |
13 | 43bba20c5a713 |
14 | 1aa62b1bd9c71 |
15 | b8ba6d7040e1 |
hex | 5b24017e3f3b |
100210202001211 has 8 divisors (see below), whose sum is σ = 100226946585600. Its totient is φ = 100193458176000.
The previous prime is 100210202001149. The next prime is 100210202001251. The reversal of 100210202001211 is 112100202012001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100210202001211 - 231 = 100208054517563 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100210202001191 and 100210202001200.
It is not an unprimeable number, because it can be changed into a prime (100210202001251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 303751995 + ... + 304081723.
It is an arithmetic number, because the mean of its divisors is an integer number (12528368323200).
Almost surely, 2100210202001211 is an apocalyptic number.
100210202001211 is a deficient number, since it is larger than the sum of its proper divisors (16744584389).
100210202001211 is an equidigital number, since it uses as much as digits as its factorization.
100210202001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379589.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100210202001211 its reverse (112100202012001), we get a palindrome (212310404013212).
The spelling of 100210202001211 in words is "one hundred trillion, two hundred ten billion, two hundred two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •