Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0001111010000110001001 |
3 | 1022210121111221200011001222 |
4 | 2103020230201322012021 |
5 | 2311130013111213001 |
6 | 33300550353451425 |
7 | 2062334325541304 |
oct | 223105441720611 |
9 | 38717457604058 |
10 | 10111100101001 |
11 | 3249103458309 |
12 | 1173722b70b75 |
13 | 58461b540063 |
14 | 26d546479b3b |
15 | 12802d8e161b |
hex | 9322c87a189 |
10111100101001 has 8 divisors (see below), whose sum is σ = 10327600323840. Its totient is φ = 9894656979648.
The previous prime is 10111100100989. The next prime is 10111100101007. The reversal of 10111100101001 is 10010100111101.
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 10111100101001 - 234 = 10093920231817 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111100101001.
It is not an unprimeable number, because it can be changed into a prime (10111100101007) 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, 13917341 + ... + 14625818.
It is an arithmetic number, because the mean of its divisors is an integer number (1290950040480).
Almost surely, 210111100101001 is an apocalyptic number.
It is an amenable number.
10111100101001 is a deficient number, since it is larger than the sum of its proper divisors (216500222839).
10111100101001 is an equidigital number, since it uses as much as digits as its factorization.
10111100101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28550743.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10111100101001 its reverse (10010100111101), we get a palindrome (20121200212102).
The spelling of 10111100101001 in words is "ten trillion, one hundred eleven billion, one hundred million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •