Base | Representation |
---|---|
bin | 1000111010100101001… |
… | …0010011010010111000 |
3 | 112122100021002111022220 |
4 | 2032221102103102320 |
5 | 10002134441034423 |
6 | 154210152044040 |
7 | 14031355353210 |
oct | 2165122232270 |
9 | 478307074286 |
10 | 153164002488 |
11 | 59a580a5042 |
12 | 25826393620 |
13 | 1159bc26193 |
14 | 75ada89240 |
15 | 3eb676b9e3 |
hex | 23a94934b8 |
153164002488 has 128 divisors (see below), whose sum is σ = 456784773120. Its totient is φ = 41845034880.
The previous prime is 153164002447. The next prime is 153164002543. The reversal of 153164002488 is 884200461351.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20888983 + ... + 20896313.
It is an arithmetic number, because the mean of its divisors is an integer number (3568631040).
Almost surely, 2153164002488 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 153164002488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228392386560).
153164002488 is an abundant number, since it is smaller than the sum of its proper divisors (303620770632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153164002488 is a wasteful number, since it uses less digits than its factorization.
153164002488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12777 (or 12773 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The spelling of 153164002488 in words is "one hundred fifty-three billion, one hundred sixty-four million, two thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •