Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …0111011001001111101010 |
3 | 1022102002121120002202010101 |
4 | 2101202100213121033222 |
5 | 2302324233142024320 |
6 | 33134240242340014 |
7 | 2051361555212161 |
oct | 221422047311752 |
9 | 38362546082111 |
10 | 10001110111210 |
11 | 32064a0a24aa9 |
12 | 115634765a60a |
13 | 57714013956a |
14 | 2680b07403d8 |
15 | 125242624c0a |
hex | 918909d93ea |
10001110111210 has 8 divisors (see below), whose sum is σ = 18001998200196. Its totient is φ = 4000444044480.
The previous prime is 10001110111127. The next prime is 10001110111241. The reversal of 10001110111210 is 1211101110001.
It can be written as a sum of positive squares in 2 ways, for example, as 8919200169009 + 1081909942201 = 2986503^2 + 1040149^2 .
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: 1000111011121 = 10001110111210 / (1 + 0 + 0 + 0 + 1 + 1 + 1 + 0 + 1 + 1 + 1 + 2 + 1 + 0).
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, 500055505551 + ... + 500055505570.
Almost surely, 210001110111210 is an apocalyptic number.
10001110111210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10001110111210 is a deficient number, since it is larger than the sum of its proper divisors (8000888088986).
10001110111210 is a wasteful number, since it uses less digits than its factorization.
10001110111210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000111011128.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 10001110111210 its reverse (1211101110001), we get a palindrome (11212211221211).
The spelling of 10001110111210 in words is "ten trillion, one billion, one hundred ten million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •