Base | Representation |
---|---|
bin | 10110101111011110111000… |
… | …101100111100000110100011 |
3 | 111010010211002221000002101010 |
4 | 112233132320230330012203 |
5 | 101102211431031211321 |
6 | 552420315451312003 |
7 | 30032130616133016 |
oct | 2657367054740643 |
9 | 433124087002333 |
10 | 100020002210211 |
11 | 29962276805816 |
12 | b27466844b603 |
13 | 43a6acc1158a5 |
14 | 1a9adcb51137d |
15 | b86b3a825676 |
hex | 5af7b8b3c1a3 |
100020002210211 has 4 divisors (see below), whose sum is σ = 133360002946952. Its totient is φ = 66680001473472.
The previous prime is 100020002210171. The next prime is 100020002210213. The reversal of 100020002210211 is 112012200020001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 100020002210211 - 226 = 100019935101347 is a prime.
It is a super-2 number, since 2×1000200022102112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100020002210213) 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, 16670000368366 + ... + 16670000368371.
It is an arithmetic number, because the mean of its divisors is an integer number (33340000736738).
Almost surely, 2100020002210211 is an apocalyptic number.
100020002210211 is a deficient number, since it is larger than the sum of its proper divisors (33340000736741).
100020002210211 is an equidigital number, since it uses as much as digits as its factorization.
100020002210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33340000736740.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100020002210211 its reverse (112012200020001), we get a palindrome (212032202230212).
The spelling of 100020002210211 in words is "one hundred trillion, twenty billion, two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •