Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0111000100001000001101 |
3 | 1022102221211211212022211122 |
4 | 2101222221013010020031 |
5 | 2303001201404013401 |
6 | 33142325334530325 |
7 | 2052130611420521 |
oct | 221525107041015 |
9 | 38387754768748 |
10 | 10010111001101 |
11 | 320a29a773882 |
12 | 1158039b069a5 |
13 | 577c45b3b903 |
14 | 2686c5d07d81 |
15 | 1255bc92a21b |
hex | 91aa91c420d |
10010111001101 has 8 divisors (see below), whose sum is σ = 10013610716160. Its totient is φ = 10006611704208.
The previous prime is 10010111001049. The next prime is 10010111001103. The reversal of 10010111001101 is 10110011101001.
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 10010111001101 - 238 = 9735233094157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010111001103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52302740 + ... + 52493778.
It is an arithmetic number, because the mean of its divisors is an integer number (1251701339520).
Almost surely, 210010111001101 is an apocalyptic number.
It is an amenable number.
10010111001101 is a deficient number, since it is larger than the sum of its proper divisors (3499715059).
10010111001101 is a wasteful number, since it uses less digits than its factorization.
10010111001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209083.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10010111001101 its reverse (10110011101001), we get a palindrome (20120122102102).
The spelling of 10010111001101 in words is "ten trillion, ten billion, one hundred eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •