Base | Representation |
---|---|
bin | 11001000010100110100101… |
… | …011111110111101111000011 |
3 | 112102221022212100122020022011 |
4 | 121002212211133313233003 |
5 | 103413332301424012011 |
6 | 1030121012210553351 |
7 | 32124426612201520 |
oct | 3102464537675703 |
9 | 472838770566264 |
10 | 110130033032131 |
11 | 320aa980620902 |
12 | 10427b31298857 |
13 | 495b2a9c70118 |
14 | 1d2a471968147 |
15 | caeb053ed621 |
hex | 6429a57f7bc3 |
110130033032131 has 32 divisors (see below), whose sum is σ = 130438291027968. Its totient is φ = 91030888471680.
The previous prime is 110130033032099. The next prime is 110130033032143. The reversal of 110130033032131 is 131230330031011.
It is a cyclic number.
It is not a de Polignac number, because 110130033032131 - 25 = 110130033032099 is a prime.
It is a super-2 number, since 2×1101300330321312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110130033032161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4779301 + ... + 15591721.
It is an arithmetic number, because the mean of its divisors is an integer number (4076196594624).
Almost surely, 2110130033032131 is an apocalyptic number.
110130033032131 is a deficient number, since it is larger than the sum of its proper divisors (20308257995837).
110130033032131 is a wasteful number, since it uses less digits than its factorization.
110130033032131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10812931.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 110130033032131 its reverse (131230330031011), we get a palindrome (241360363063142).
The spelling of 110130033032131 in words is "one hundred ten trillion, one hundred thirty billion, thirty-three million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •