Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1100001000111111011101 |
3 | 1022102012011122000211120202 |
4 | 2101203023230020333131 |
5 | 2302333300402223401 |
6 | 33134522445153245 |
7 | 2051425251344216 |
oct | 221431354107735 |
9 | 38365148024522 |
10 | 10002101211101 |
11 | 320695a41a01a |
12 | 115658355b825 |
13 | 57726a57b6bc |
14 | 26816621240d |
15 | 12529e64906b |
hex | 918cbb08fdd |
10002101211101 has 8 divisors (see below), whose sum is σ = 10210064849184. Its totient is φ = 9795863412720.
The previous prime is 10002101211061. The next prime is 10002101211103. The reversal of 10002101211101 is 10111210120001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10002101211101 - 214 = 10002101194717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002101211103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 431448215 + ... + 431471396.
It is an arithmetic number, because the mean of its divisors is an integer number (1276258106148).
Almost surely, 210002101211101 is an apocalyptic number.
It is an amenable number.
10002101211101 is a deficient number, since it is larger than the sum of its proper divisors (207963638083).
10002101211101 is an equidigital number, since it uses as much as digits as its factorization.
10002101211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862919851.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10002101211101 its reverse (10111210120001), we get a palindrome (20113311331102).
The spelling of 10002101211101 in words is "ten trillion, two billion, one hundred one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •