Base | Representation |
---|---|
bin | 110011010010001100… |
… | …0100111111110010100 |
3 | 101112021021222101220011 |
4 | 1212210120213332110 |
5 | 3301022304213022 |
6 | 122332145050004 |
7 | 10646114261413 |
oct | 1464430477624 |
9 | 345237871804 |
10 | 110132101012 |
11 | 427857775aa |
12 | 19417026904 |
13 | a50199ca9b |
14 | 548a96d47a |
15 | 2ce89dd977 |
hex | 19a4627f94 |
110132101012 has 12 divisors (see below), whose sum is σ = 195170812480. Its totient is φ = 54369011736.
The previous prime is 110132100931. The next prime is 110132101021. The reversal of 110132101012 is 210101231011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110132100983 and 110132101001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174259338 + ... + 174259969.
Almost surely, 2110132101012 is an apocalyptic number.
It is an amenable number.
110132101012 is a deficient number, since it is larger than the sum of its proper divisors (85038711468).
110132101012 is a wasteful number, since it uses less digits than its factorization.
110132101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348519390 (or 348519388 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110132101012 its reverse (210101231011), we get a palindrome (320233332023).
The spelling of 110132101012 in words is "one hundred ten billion, one hundred thirty-two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •