Base | Representation |
---|---|
bin | 10110110010010001111000… |
… | …100110000111111001011011 |
3 | 111010211012012112110002122011 |
4 | 112302101320212013321123 |
5 | 101113334041223210021 |
6 | 553044503233410351 |
7 | 30052043512153531 |
oct | 2662217046077133 |
9 | 433735175402564 |
10 | 100212200210011 |
11 | 29a2683454576a |
12 | b2a59671099b7 |
13 | 43bbc7bc286a6 |
14 | 1aa642134a151 |
15 | b8bb38d60de1 |
hex | 5b2478987e5b |
100212200210011 has 4 divisors (see below), whose sum is σ = 100212684971472. Its totient is φ = 100211715448552.
The previous prime is 100212200209969. The next prime is 100212200210027. The reversal of 100212200210011 is 110012002212001.
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 100212200210011 - 237 = 100074761256539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100212200209973 and 100212200210000.
It is not an unprimeable number, because it can be changed into a prime (100212200210911) 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, 242070511 + ... + 242484136.
It is an arithmetic number, because the mean of its divisors is an integer number (25053171242868).
Almost surely, 2100212200210011 is an apocalyptic number.
100212200210011 is a deficient number, since it is larger than the sum of its proper divisors (484761461).
100212200210011 is an equidigital number, since it uses as much as digits as its factorization.
100212200210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484761460.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100212200210011 its reverse (110012002212001), we get a palindrome (210224202422012).
The spelling of 100212200210011 in words is "one hundred trillion, two hundred twelve billion, two hundred million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •