Base | Representation |
---|---|
bin | 1000111010011000010… |
… | …0110000100000001100 |
3 | 112122012111201000002020 |
4 | 2032212010300200030 |
5 | 10002032142323320 |
6 | 154200545130140 |
7 | 14030132356563 |
oct | 2164604604014 |
9 | 478174630066 |
10 | 153110120460 |
11 | 59a2a742740 |
12 | 25810329950 |
13 | 11590a0bb1b |
14 | 75a6860bda |
15 | 3eb1b76940 |
hex | 23a613080c |
153110120460 has 48 divisors (see below), whose sum is σ = 467681824512. Its totient is φ = 37117604800.
The previous prime is 153110120459. The next prime is 153110120473. The reversal of 153110120460 is 64021011351.
It is a happy number.
It is a super-2 number, since 2×1531101204602 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 153110120460.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115991856 + ... + 115993175.
It is an arithmetic number, because the mean of its divisors is an integer number (9743371344).
Almost surely, 2153110120460 is an apocalyptic number.
153110120460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153110120460 is an abundant number, since it is smaller than the sum of its proper divisors (314571704052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153110120460 is a wasteful number, since it uses less digits than its factorization.
153110120460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231985054 (or 231985052 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
The spelling of 153110120460 in words is "one hundred fifty-three billion, one hundred ten million, one hundred twenty thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •