Base | Representation |
---|---|
bin | 110011011010100100… |
… | …1101111101101110000 |
3 | 101112222220022112201021 |
4 | 1212311021233231300 |
5 | 3302111313210412 |
6 | 122420114345224 |
7 | 10656101345563 |
oct | 1466511575560 |
9 | 345886275637 |
10 | 110413413232 |
11 | 4290a547641 |
12 | 1949528b214 |
13 | a548056815 |
14 | 54b607a4da |
15 | 2d1355a607 |
hex | 19b526fb70 |
110413413232 has 120 divisors (see below), whose sum is σ = 226522939104. Its totient is φ = 52129431552.
The previous prime is 110413413223. The next prime is 110413413277. The reversal of 110413413232 is 232314314011.
It is a super-2 number, since 2×1104134132322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110413413197 and 110413413206.
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, 419822733 + ... + 419822995.
Almost surely, 2110413413232 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 110413413232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113261469552).
110413413232 is an abundant number, since it is smaller than the sum of its proper divisors (116109525872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110413413232 is a wasteful number, since it uses less digits than its factorization.
110413413232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767 (or 738 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 110413413232 its reverse (232314314011), we get a palindrome (342727727243).
The spelling of 110413413232 in words is "one hundred ten billion, four hundred thirteen million, four hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •