Base | Representation |
---|---|
bin | 1001001100100110111010… |
… | …1100001101111100101010 |
3 | 1022210201101022022221110101 |
4 | 2103021232230031330222 |
5 | 2311134301241200020 |
6 | 33301252444540014 |
7 | 2062403664431104 |
oct | 223115654157452 |
9 | 38721338287411 |
10 | 10112210100010 |
11 | 3249622a81a67 |
12 | 117399285160a |
13 | 5847674b1cc5 |
14 | 26d60da5c574 |
15 | 1280960a000a |
hex | 9326eb0df2a |
10112210100010 has 16 divisors (see below), whose sum is σ = 18206282341800. Its totient is φ = 4043927559616.
The previous prime is 10112210099989. The next prime is 10112210100023. The reversal of 10112210100010 is 1000101221101.
It can be written as a sum of positive squares in 4 ways, for example, as 7933849590681 + 2178360509329 = 2816709^2 + 1475927^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 10112210100010.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 119515645 + ... + 119600224.
Almost surely, 210112210100010 is an apocalyptic number.
10112210100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10112210100010 is a deficient number, since it is larger than the sum of its proper divisors (8094072241790).
10112210100010 is a wasteful number, since it uses less digits than its factorization.
10112210100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239120105.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10112210100010 its reverse (1000101221101), we get a palindrome (11112311321111).
The spelling of 10112210100010 in words is "ten trillion, one hundred twelve billion, two hundred ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •