Base | Representation |
---|---|
bin | 1000111011110101010… |
… | …1010001010101101110 |
3 | 112200012200221110101202 |
4 | 2032331111101111232 |
5 | 10003332040401410 |
6 | 154303404405502 |
7 | 14042611144040 |
oct | 2167525212556 |
9 | 480180843352 |
10 | 153500325230 |
11 | 5a10aa2831a |
12 | 258bab46892 |
13 | 11623800b15 |
14 | 76025d5a90 |
15 | 3ed6052ca5 |
hex | 23bd55156e |
153500325230 has 32 divisors (see below), whose sum is σ = 315862848000. Its totient is φ = 52613557920.
The previous prime is 153500325161. The next prime is 153500325257. The reversal of 153500325230 is 32523005351.
153500325230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 153500325193 and 153500325202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68426 + ... + 558285.
It is an arithmetic number, because the mean of its divisors is an integer number (9870714000).
Almost surely, 2153500325230 is an apocalyptic number.
153500325230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153500325230 is an abundant number, since it is smaller than the sum of its proper divisors (162362522770).
153500325230 is a wasteful number, since it uses less digits than its factorization.
153500325230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630224.
The product of its (nonzero) digits is 13500, while the sum is 29.
The spelling of 153500325230 in words is "one hundred fifty-three billion, five hundred million, three hundred twenty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •