Base | Representation |
---|---|
bin | 1000111010111011001… |
… | …1101000010000000000 |
3 | 112122120201101012201221 |
4 | 2032232303220100000 |
5 | 10002332144001102 |
6 | 154223301204424 |
7 | 14033561551141 |
oct | 2165663502000 |
9 | 478521335657 |
10 | 153256625152 |
11 | 59aa54078a4 |
12 | 25851400714 |
13 | 115b5185aa7 |
14 | 75bc0b9ac8 |
15 | 3ebe965637 |
hex | 23aece8400 |
153256625152 has 88 divisors (see below), whose sum is σ = 311095215896. Its totient is φ = 75448516608.
The previous prime is 153256625143. The next prime is 153256625153. The reversal of 153256625152 is 251526652351.
It can be written as a sum of positive squares in 4 ways, for example, as 89558941696 + 63697683456 = 299264^2 + 252384^2 .
It is a junction number, because it is equal to n+sod(n) for n = 153256625099 and 153256625108.
It is not an unprimeable number, because it can be changed into a prime (153256625153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54791818 + ... + 54794614.
Almost surely, 2153256625152 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 153256625152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155547607948).
153256625152 is an abundant number, since it is smaller than the sum of its proper divisors (157838590744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153256625152 is an equidigital number, since it uses as much as digits as its factorization.
153256625152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3623 (or 3605 counting only the distinct ones).
The product of its digits is 540000, while the sum is 43.
The spelling of 153256625152 in words is "one hundred fifty-three billion, two hundred fifty-six million, six hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •