Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0011110011001011110001 |
3 | 1022110001101202211201122212 |
4 | 2101223210003303023301 |
5 | 2303010213100013014 |
6 | 33143011424341505 |
7 | 2052164250655262 |
oct | 221534403631361 |
9 | 38401352751585 |
10 | 10011100001009 |
11 | 320a757a64078 |
12 | 1158275174895 |
13 | 5780729c6c63 |
14 | 26877b3d0969 |
15 | 12562968723e |
hex | 91ae40f32f1 |
10011100001009 has 4 divisors (see below), whose sum is σ = 10036835476980. Its totient is φ = 9985364525040.
The previous prime is 10011100000987. The next prime is 10011100001033. The reversal of 10011100001009 is 90010000111001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6185566926400 + 3825533074609 = 2487080^2 + 1955897^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011100001009 - 232 = 10006805033713 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011100000984 and 10011100001002.
It is not an unprimeable number, because it can be changed into a prime (10011100051009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12867737402 + ... + 12867738179.
It is an arithmetic number, because the mean of its divisors is an integer number (2509208869245).
Almost surely, 210011100001009 is an apocalyptic number.
It is an amenable number.
10011100001009 is a deficient number, since it is larger than the sum of its proper divisors (25735475971).
10011100001009 is an equidigital number, since it uses as much as digits as its factorization.
10011100001009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25735475970.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 10011100001009 in words is "ten trillion, eleven billion, one hundred million, one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •