Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …0110101100101000101010 |
3 | 1110100002212000002200010121 |
4 | 2201222333212230220222 |
5 | 2424011240001120020 |
6 | 35343510305433454 |
7 | 2224446105006163 |
oct | 241527746545052 |
9 | 43302760080117 |
10 | 11110000020010 |
11 | 35a37a7413061 |
12 | 12b523863b88a |
13 | 62788c92a0a8 |
14 | 2a5a2676276a |
15 | 143ee37a7baa |
hex | a1abf9aca2a |
11110000020010 has 8 divisors (see below), whose sum is σ = 19998000036036. Its totient is φ = 4444000008000.
The previous prime is 11110000019981. The next prime is 11110000020017. The reversal of 11110000020010 is 1002000001111.
It can be written as a sum of positive squares in 2 ways, for example, as 11108295733921 + 1704286089 = 3332911^2 + 41283^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11110000019975 and 11110000020002.
It is not an unprimeable number, because it can be changed into a prime (11110000020017) 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 3 ways as a sum of consecutive naturals, for example, 555500000991 + ... + 555500001010.
Almost surely, 211110000020010 is an apocalyptic number.
11110000020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11110000020010 is a deficient number, since it is larger than the sum of its proper divisors (8888000016026).
11110000020010 is a wasteful number, since it uses less digits than its factorization.
11110000020010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111000002008.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11110000020010 its reverse (1002000001111), we get a palindrome (12112000021121).
The spelling of 11110000020010 in words is "eleven trillion, one hundred ten billion, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •