Base | Representation |
---|---|
bin | 11001000010001010110011… |
… | …011111110101001000100101 |
3 | 112102211110212110102021022001 |
4 | 121002022303133311020211 |
5 | 103412340204000201204 |
6 | 1030055200212405301 |
7 | 32122322446214140 |
oct | 3102126337651045 |
9 | 472743773367261 |
10 | 110100203131429 |
11 | 320992633a7a05 |
12 | 104221a7316831 |
13 | 4958534bc35c4 |
14 | 1d28c41d5b057 |
15 | cade5b6c44a4 |
hex | 6422b37f5225 |
110100203131429 has 64 divisors (see below), whose sum is σ = 129152685150720. Its totient is φ = 91917560401920.
The previous prime is 110100203131423. The next prime is 110100203131441. The reversal of 110100203131429 is 924131302001011.
It is a cyclic number.
It is not a de Polignac number, because 110100203131429 - 27 = 110100203131301 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100203131397 and 110100203131406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100203131423) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 29975550337 + ... + 29975554009.
It is an arithmetic number, because the mean of its divisors is an integer number (2018010705480).
Almost surely, 2110100203131429 is an apocalyptic number.
It is an amenable number.
110100203131429 is a deficient number, since it is larger than the sum of its proper divisors (19052482019291).
110100203131429 is an equidigital number, since it uses as much as digits as its factorization.
110100203131429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5390.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 110100203131429 in words is "one hundred ten trillion, one hundred billion, two hundred three million, one hundred thirty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •