Base | Representation |
---|---|
bin | 10110110010011010001100… |
… | …010000110110010110001011 |
3 | 111010212001020011211001211220 |
4 | 112302122030100312112023 |
5 | 101114010323222041021 |
6 | 553052540314053123 |
7 | 30052510533112653 |
oct | 2662321420662613 |
9 | 433761204731756 |
10 | 100221120112011 |
11 | 29a2a5a15a90a8 |
12 | b2a763641a1a3 |
13 | 43bca70c12b02 |
14 | 1aa6a29c71363 |
15 | b8beabeb9cc6 |
hex | 5b268c43658b |
100221120112011 has 8 divisors (see below), whose sum is σ = 140661221209920. Its totient is φ = 63297549544392.
The previous prime is 100221120111997. The next prime is 100221120112021. The reversal of 100221120112011 is 110211021122001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100221120112011 - 210 = 100221120110987 is a prime.
It is a super-2 number, since 2×1002211201120112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100221120112021) 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, 879132632505 + ... + 879132632618.
It is an arithmetic number, because the mean of its divisors is an integer number (17582652651240).
Almost surely, 2100221120112011 is an apocalyptic number.
100221120112011 is a deficient number, since it is larger than the sum of its proper divisors (40440101097909).
100221120112011 is a wasteful number, since it uses less digits than its factorization.
100221120112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1758265265145.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100221120112011 its reverse (110211021122001), we get a palindrome (210432141234012).
The spelling of 100221120112011 in words is "one hundred trillion, two hundred twenty-one billion, one hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •