Base | Representation |
---|---|
bin | 10110110010001000100101… |
… | …001000100010101101101011 |
3 | 111010210020102022010110022211 |
4 | 112302020211020202231223 |
5 | 101113203111230341021 |
6 | 553040132041025551 |
7 | 30051241113655042 |
oct | 2662104510425553 |
9 | 433706368113284 |
10 | 100202210012011 |
11 | 29a22578316088 |
12 | b2a3a394852b7 |
13 | 43bb049290923 |
14 | 1aa5b54619559 |
15 | b8b751c8c3e1 |
hex | 5b2225222b6b |
100202210012011 has 4 divisors (see below), whose sum is σ = 100202604950800. Its totient is φ = 100201815073224.
The previous prime is 100202210011991. The next prime is 100202210012017. The reversal of 100202210012011 is 110210012202001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100202210012011 - 217 = 100202209880939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100202210011982 and 100202210012000.
It is not an unprimeable number, because it can be changed into a prime (100202210012017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 197088576 + ... + 197596333.
It is an arithmetic number, because the mean of its divisors is an integer number (25050651237700).
Almost surely, 2100202210012011 is an apocalyptic number.
100202210012011 is a deficient number, since it is larger than the sum of its proper divisors (394938789).
100202210012011 is an equidigital number, since it uses as much as digits as its factorization.
100202210012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394938788.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100202210012011 its reverse (110210012202001), we get a palindrome (210412222214012).
The spelling of 100202210012011 in words is "one hundred trillion, two hundred two billion, two hundred ten million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •