Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …0001111101000101101001 |
3 | 1022110001102121121102122002 |
4 | 2101223210301331011221 |
5 | 2303010224144201301 |
6 | 33143012535540345 |
7 | 2052164455550012 |
oct | 221534461750551 |
9 | 38401377542562 |
10 | 10011112100201 |
11 | 320a763878403 |
12 | 115827922a6b5 |
13 | 578075372144 |
14 | 26877cc60009 |
15 | 12562a77716b |
hex | 91ae4c7d169 |
10011112100201 has 8 divisors (see below), whose sum is σ = 10450271451840. Its totient is φ = 9572277215952.
The previous prime is 10011112100191. The next prime is 10011112100237. The reversal of 10011112100201 is 10200121111001.
10011112100201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011112100201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011112100251) 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, 81053786 + ... + 81177203.
It is an arithmetic number, because the mean of its divisors is an integer number (1306283931480).
Almost surely, 210011112100201 is an apocalyptic number.
It is an amenable number.
10011112100201 is a deficient number, since it is larger than the sum of its proper divisors (439159351639).
10011112100201 is a wasteful number, since it uses less digits than its factorization.
10011112100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162233695.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10011112100201 its reverse (10200121111001), we get a palindrome (20211233211202).
The spelling of 10011112100201 in words is "ten trillion, eleven billion, one hundred twelve million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •