Base | Representation |
---|---|
bin | 1000111011000110000… |
… | …1001011011001000000 |
3 | 112122200212222120221022 |
4 | 2032301201023121000 |
5 | 10002430320320000 |
6 | 154232004245012 |
7 | 14034653343161 |
oct | 2166141133100 |
9 | 478625876838 |
10 | 153302120000 |
11 | 5a019060847 |
12 | 258646a0768 |
13 | 115c1724713 |
14 | 75c415d768 |
15 | 3ec3950585 |
hex | 23b184b640 |
153302120000 has 140 divisors (see below), whose sum is σ = 393250666380. Its totient is φ = 59205888000.
The previous prime is 153302119979. The next prime is 153302120057. The reversal of 153302120000 is 21203351.
It can be written as a sum of positive squares in 10 ways, for example, as 111070225984 + 42231894016 = 333272^2 + 205504^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1093922 + ... + 1226078.
Almost surely, 2153302120000 is an apocalyptic number.
153302120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 153302120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196625333190).
153302120000 is an abundant number, since it is smaller than the sum of its proper divisors (239948546380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153302120000 is an equidigital number, since it uses as much as digits as its factorization.
153302120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132218 (or 132193 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
Adding to 153302120000 its reverse (21203351), we get a palindrome (153323323351).
The spelling of 153302120000 in words is "one hundred fifty-three billion, three hundred two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •