Base | Representation |
---|---|
bin | 1001000110110001100110… |
… | …1101011100110111101110 |
3 | 1022110010201111120002222001 |
4 | 2101230121231130313232 |
5 | 2303014034012041420 |
6 | 33143241021042514 |
7 | 2052225460536013 |
oct | 221543155346756 |
9 | 38403644502861 |
10 | 10012000112110 |
11 | 321007a061947 |
12 | 11584866b643a |
13 | 57818732c089 |
14 | 268824b7970a |
15 | 12567d6d6b0a |
hex | 91b19b5cdee |
10012000112110 has 8 divisors (see below), whose sum is σ = 18021600201816. Its totient is φ = 4004800044840.
The previous prime is 10012000111991. The next prime is 10012000112159. The reversal of 10012000112110 is 1121100021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1001200011211 = 10012000112110 / (1 + 0 + 0 + 1 + 2 + 0 + 0 + 0 + 1 + 1 + 2 + 1 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500600005596 + ... + 500600005615.
It is an arithmetic number, because the mean of its divisors is an integer number (2252700025227).
Almost surely, 210012000112110 is an apocalyptic number.
10012000112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10012000112110 is a deficient number, since it is larger than the sum of its proper divisors (8009600089706).
10012000112110 is a wasteful number, since it uses less digits than its factorization.
10012000112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001200011218.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10012000112110 its reverse (1121100021001), we get a palindrome (11133100133111).
The spelling of 10012000112110 in words is "ten trillion, twelve billion, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •