Base | Representation |
---|---|
bin | 1000111010100001110… |
… | …0111101111001010000 |
3 | 112122022021210011121102 |
4 | 2032220130331321100 |
5 | 10002122401134300 |
6 | 154204532243532 |
7 | 14031125462351 |
oct | 2165034757120 |
9 | 478267704542 |
10 | 153150021200 |
11 | 59a50215760 |
12 | 258217705a8 |
13 | 1159906c427 |
14 | 75abc89d28 |
15 | 3eb54090d5 |
hex | 23a873de50 |
153150021200 has 120 divisors (see below), whose sum is σ = 410727494496. Its totient is φ = 54395712000.
The previous prime is 153150021149. The next prime is 153150021229. The reversal of 153150021200 is 2120051351.
It is a happy number.
153150021200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 215531 + ... + 593930.
Almost surely, 2153150021200 is an apocalyptic number.
153150021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153150021200 is an abundant number, since it is smaller than the sum of its proper divisors (257577473296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153150021200 is a wasteful number, since it uses less digits than its factorization.
153150021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809533 (or 809522 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 153150021200 its reverse (2120051351), we get a palindrome (155270072551).
The spelling of 153150021200 in words is "one hundred fifty-three billion, one hundred fifty million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •