Base | Representation |
---|---|
bin | 100010111000010001000001… |
… | …001011001110100101011100 |
3 | 202010010220120212220211211000 |
4 | 202320101001023032211130 |
5 | 130101301444211000200 |
6 | 1302131015352230300 |
7 | 44211536414636532 |
oct | 4270210113164534 |
9 | 663126525824730 |
10 | 153400145406300 |
11 | 449726aaa48231 |
12 | 15255b8639b390 |
13 | 6779757b88180 |
14 | 29c486c926152 |
15 | 12b04531e0300 |
hex | 8b84412ce95c |
153400145406300 has 288 divisors, whose sum is σ = 548219782799360. Its totient is φ = 36541969862400.
The previous prime is 153400145406281. The next prime is 153400145406323. The reversal of 153400145406300 is 3604541004351.
153400145406300 is a `hidden beast` number, since 1 + 5 + 3 + 4 + 0 + 0 + 14 + 5 + 4 + 0 + 630 + 0 = 666.
It is a super-2 number, since 2×1534001454063002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 69401812 + ... + 71578011.
Almost surely, 2153400145406300 is an apocalyptic number.
153400145406300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153400145406300 is an abundant number, since it is smaller than the sum of its proper divisors (394819637393060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153400145406300 is a wasteful number, since it uses less digits than its factorization.
153400145406300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140979890 (or 140979877 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 153400145406300 in words is "one hundred fifty-three trillion, four hundred billion, one hundred forty-five million, four hundred six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •