Base | Representation |
---|---|
bin | 1001001100100110100000… |
… | …1000101011100110110010 |
3 | 1022210201002122101102122002 |
4 | 2103021220020223212302 |
5 | 2311134040112333020 |
6 | 33301233515414002 |
7 | 2062401160554446 |
oct | 223115010534662 |
9 | 38721078342562 |
10 | 10112100121010 |
11 | 3249576995128 |
12 | 1173961a54302 |
13 | 58474a786384 |
14 | 26d5dd1d0826 |
15 | 12808b5c8975 |
hex | 9326822b9b2 |
10112100121010 has 16 divisors (see below), whose sum is σ = 18202326615000. Its totient is φ = 4044718626816.
The previous prime is 10112100120971. The next prime is 10112100121021. The reversal of 10112100121010 is 1012100121101.
It can be written as a sum of positive squares in 4 ways, for example, as 10035153244561 + 76946876449 = 3167831^2 + 277393^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10112100120982 and 10112100121000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14827535 + ... + 15494514.
Almost surely, 210112100121010 is an apocalyptic number.
10112100121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10112100121010 is a deficient number, since it is larger than the sum of its proper divisors (8090226493990).
10112100121010 is a wasteful number, since it uses less digits than its factorization.
10112100121010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30355405.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10112100121010 its reverse (1012100121101), we get a palindrome (11124200242111).
Subtracting from 10112100121010 its reverse (1012100121101), we obtain a palindrome (9099999999909).
The spelling of 10112100121010 in words is "ten trillion, one hundred twelve billion, one hundred million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •