Base | Representation |
---|---|
bin | 1000111010011000010… |
… | …0101101111110011110 |
3 | 112122012111200110212220 |
4 | 2032212010231332132 |
5 | 10002032142010420 |
6 | 154200545010210 |
7 | 14030132314446 |
oct | 2164604557636 |
9 | 478174613786 |
10 | 153110110110 |
11 | 59a2a735991 |
12 | 25810323966 |
13 | 11590a071b9 |
14 | 75a685b126 |
15 | 3eb1b73840 |
hex | 23a612df9e |
153110110110 has 32 divisors (see below), whose sum is σ = 379317952512. Its totient is φ = 39512286240.
The previous prime is 153110110063. The next prime is 153110110121. The reversal of 153110110110 is 11011011351.
It is a super-3 number, since 3×1531101101103 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 153110110110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82316334 + ... + 82318193.
It is an arithmetic number, because the mean of its divisors is an integer number (11853686016).
Almost surely, 2153110110110 is an apocalyptic number.
153110110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153110110110 is an abundant number, since it is smaller than the sum of its proper divisors (226207842402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153110110110 is a wasteful number, since it uses less digits than its factorization.
153110110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164634568.
The product of its (nonzero) digits is 15, while the sum is 15.
Adding to 153110110110 its reverse (11011011351), we get a palindrome (164121121461).
The spelling of 153110110110 in words is "one hundred fifty-three billion, one hundred ten million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •