Base | Representation |
---|---|
bin | 10110101111100000110101… |
… | …101111011000010011011011 |
3 | 111010011000112010100221201201 |
4 | 112233200311233120103123 |
5 | 101102230230100031021 |
6 | 552421303550255031 |
7 | 30032233611102055 |
oct | 2657406557302333 |
9 | 433130463327651 |
10 | 100022100002011 |
11 | 29963152975850 |
12 | b274b52ab7477 |
13 | 43a707490c605 |
14 | 1a9b149d848d5 |
15 | b86c0eaa3591 |
hex | 5af835bd84db |
100022100002011 has 4 divisors (see below), whose sum is σ = 109115018184024. Its totient is φ = 90929181820000.
The previous prime is 100022100001939. The next prime is 100022100002063. The reversal of 100022100002011 is 110200001220001.
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 100022100002011 - 227 = 100021965784283 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100022100702011) 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, 4546459090990 + ... + 4546459091011.
It is an arithmetic number, because the mean of its divisors is an integer number (27278754546006).
Almost surely, 2100022100002011 is an apocalyptic number.
100022100002011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100022100002011 is a deficient number, since it is larger than the sum of its proper divisors (9092918182013).
100022100002011 is an equidigital number, since it uses as much as digits as its factorization.
100022100002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9092918182012.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100022100002011 its reverse (110200001220001), we get a palindrome (210222101222012).
The spelling of 100022100002011 in words is "one hundred trillion, twenty-two billion, one hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •