Base | Representation |
---|---|
bin | 110011001111001101… |
… | …0110011101110010011 |
3 | 101112000022122021000111 |
4 | 1212132122303232103 |
5 | 3300321143311011 |
6 | 122314211502151 |
7 | 10643460440311 |
oct | 1463632635623 |
9 | 345008567014 |
10 | 110032010131 |
11 | 4273422386a |
12 | 193a95b7957 |
13 | a4b7026b04 |
14 | 547b5570b1 |
15 | 2cded1c121 |
hex | 199e6b3b93 |
110032010131 has 8 divisors (see below), whose sum is σ = 110563533200. Its totient is φ = 109500582240.
The previous prime is 110032010119. The next prime is 110032010167. The reversal of 110032010131 is 131010230011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110032010131 - 27 = 110032010003 is a prime.
It is a super-2 number, since 2×1100320101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110032010831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3654085 + ... + 3684073.
It is an arithmetic number, because the mean of its divisors is an integer number (13820441650).
Almost surely, 2110032010131 is an apocalyptic number.
110032010131 is a deficient number, since it is larger than the sum of its proper divisors (531523069).
110032010131 is a wasteful number, since it uses less digits than its factorization.
110032010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47589.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 110032010131 its reverse (131010230011), we get a palindrome (241042240142).
The spelling of 110032010131 in words is "one hundred ten billion, thirty-two million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •