Base | Representation |
---|---|
bin | 1001001101001011110000… |
… | …1011100100110000001110 |
3 | 1022211122220120010000002101 |
4 | 2103102330023210300032 |
5 | 2311320030111200420 |
6 | 33310010101545314 |
7 | 2063204035151455 |
oct | 223227413446016 |
9 | 38748816100071 |
10 | 10122100100110 |
11 | 3252838695469 |
12 | 1175892a1523a |
13 | 58568246717b |
14 | 26dcab349b9c |
15 | 12847448060a |
hex | 934bc2e4c0e |
10122100100110 has 8 divisors (see below), whose sum is σ = 18219780180216. Its totient is φ = 4048840040040.
The previous prime is 10122100100107. The next prime is 10122100100137. The reversal of 10122100100110 is 1100100122101.
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: 1012210010011 = 10122100100110 / (1 + 0 + 1 + 2 + 2 + 1 + 0 + 0 + 1 + 0 + 0 + 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, 506105004996 + ... + 506105005015.
It is an arithmetic number, because the mean of its divisors is an integer number (2277472522527).
Almost surely, 210122100100110 is an apocalyptic number.
10122100100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122100100110 is a deficient number, since it is larger than the sum of its proper divisors (8097680080106).
10122100100110 is a wasteful number, since it uses less digits than its factorization.
10122100100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012210010018.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10122100100110 its reverse (1100100122101), we get a palindrome (11222200222211).
The spelling of 10122100100110 in words is "ten trillion, one hundred twenty-two billion, one hundred million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •