Base | Representation |
---|---|
bin | 10000001001111110111… |
… | …011101010000001111000 |
3 | 10221010200220202000221002 |
4 | 100021332323222001320 |
5 | 121142223132131412 |
6 | 2210011054104132 |
7 | 143132363620400 |
oct | 20117673520170 |
9 | 3833626660832 |
10 | 1110231130232 |
11 | 398934590624 |
12 | 15b2061ab048 |
13 | 8090462c2a3 |
14 | 3ba421d3800 |
15 | 1dd2dcb6dc2 |
hex | 1027eeea078 |
1110231130232 has 96 divisors (see below), whose sum is σ = 2437027553520. Its totient is φ = 472775546880.
The previous prime is 1110231130223. The next prime is 1110231130247. The reversal of 1110231130232 is 2320311320111.
It is a happy number.
It is a super-2 number, since 2×11102311302322 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 141121163 + ... + 141129029.
Almost surely, 21110231130232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1110231130232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1218513776760).
1110231130232 is an abundant number, since it is smaller than the sum of its proper divisors (1326796423288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110231130232 is a wasteful number, since it uses less digits than its factorization.
1110231130232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10141 (or 10130 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1110231130232 its reverse (2320311320111), we get a palindrome (3430542450343).
The spelling of 1110231130232 in words is "one trillion, one hundred ten billion, two hundred thirty-one million, one hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •