Base | Representation |
---|---|
bin | 1000111010011100110… |
… | …0001011100111000000 |
3 | 112122020210221020120000 |
4 | 2032213030023213000 |
5 | 10002101440444322 |
6 | 154202454320000 |
7 | 14030450460405 |
oct | 2164714134700 |
9 | 478223836500 |
10 | 153128843712 |
11 | 59a3a2707a9 |
12 | 25816659000 |
13 | 11594866080 |
14 | 75a91362ac |
15 | 3eb36243ac |
hex | 23a730b9c0 |
153128843712 has 140 divisors (see below), whose sum is σ = 488839145256. Its totient is φ = 47116546560.
The previous prime is 153128843671. The next prime is 153128843719. The reversal of 153128843712 is 217348821351.
153128843712 is a `hidden beast` number, since 1 + 531 + 2 + 8 + 8 + 43 + 71 + 2 = 666.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153128843719) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 1068714 + ... + 1203497.
Almost surely, 2153128843712 is an apocalyptic number.
153128843712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153128843712 is an abundant number, since it is smaller than the sum of its proper divisors (335710301544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153128843712 is a wasteful number, since it uses less digits than its factorization.
153128843712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2272248 (or 2272229 counting only the distinct ones).
The product of its digits is 322560, while the sum is 45.
The spelling of 153128843712 in words is "one hundred fifty-three billion, one hundred twenty-eight million, eight hundred forty-three thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •