Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …100111101100100010000001 |
3 | 112102111212001210210011222012 |
4 | 121000312303213230202001 |
5 | 103404401000241131004 |
6 | 1025545522403422305 |
7 | 32112650423555153 |
oct | 3100666347544201 |
9 | 472455053704865 |
10 | 110010010880129 |
11 | 32063a90206648 |
12 | 10408816084995 |
13 | 494cb902cac79 |
14 | 1d247276d6ad3 |
15 | cab92d51e46e |
hex | 640db39ec881 |
110010010880129 has 2 divisors, whose sum is σ = 110010010880130. Its totient is φ = 110010010880128.
The previous prime is 110010010880123. The next prime is 110010010880173. The reversal of 110010010880129 is 921088010010011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109310203343104 + 699807537025 = 10455152^2 + 836545^2 .
It is a cyclic number.
It is not a de Polignac number, because 110010010880129 - 236 = 109941291403393 is a prime.
It is a super-2 number, since 2×1100100108801292 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110010010880095 and 110010010880104.
It is not a weakly prime, because it can be changed into another prime (110010010880123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005005440064 + 55005005440065.
It is an arithmetic number, because the mean of its divisors is an integer number (55005005440065).
Almost surely, 2110010010880129 is an apocalyptic number.
It is an amenable number.
110010010880129 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010010880129 is an equidigital number, since it uses as much as digits as its factorization.
110010010880129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 32.
The spelling of 110010010880129 in words is "one hundred ten trillion, ten billion, ten million, eight hundred eighty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •