Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …101101111001011100010000 |
3 | 112110012010002122020020020120 |
4 | 121003220230231321130100 |
5 | 103421013142401010112 |
6 | 1030213352235510240 |
7 | 32132522014665666 |
oct | 3103505455713420 |
9 | 473163078206216 |
10 | 110201021110032 |
11 | 32127a99533486 |
12 | 10439842bb8380 |
13 | 4964bb100c248 |
14 | 1d2da878a6c36 |
15 | cb18ac637e8c |
hex | 643a2cb79710 |
110201021110032 has 40 divisors (see below), whose sum is σ = 288115922671584. Its totient is φ = 36291099320064.
The previous prime is 110201021110031. The next prime is 110201021110129. The reversal of 110201021110032 is 230011120102011.
It is a junction number, because it is equal to n+sod(n) for n = 110201021109993 and 110201021110020.
It is not an unprimeable number, because it can be changed into a prime (110201021110031) 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, 13830445453 + ... + 13830453420.
Almost surely, 2110201021110032 is an apocalyptic number.
110201021110032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110201021110032 is an abundant number, since it is smaller than the sum of its proper divisors (177914901561552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201021110032 is a wasteful number, since it uses less digits than its factorization.
110201021110032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27660898967 (or 27660898961 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 110201021110032 its reverse (230011120102011), we get a palindrome (340212141212043).
The spelling of 110201021110032 in words is "one hundred ten trillion, two hundred one billion, twenty-one million, one hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •