Base | Representation |
---|---|
bin | 1000111010101010010… |
… | …1110101011111110100 |
3 | 112122101210022000210120 |
4 | 2032222211311133310 |
5 | 10002211042304112 |
6 | 154212253251540 |
7 | 14032042446000 |
oct | 2165245653764 |
9 | 478353260716 |
10 | 153185900532 |
11 | 59a694a13a5 |
12 | 25831793bb0 |
13 | 115a36224c2 |
14 | 75b2949700 |
15 | 3eb8644e8c |
hex | 23aa9757f4 |
153185900532 has 48 divisors (see below), whose sum is σ = 416832393600. Its totient is φ = 43767398976.
The previous prime is 153185900521. The next prime is 153185900533. The reversal of 153185900532 is 235009581351.
153185900532 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153185900533) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18604473 + ... + 18612704.
It is an arithmetic number, because the mean of its divisors is an integer number (8684008200).
Almost surely, 2153185900532 is an apocalyptic number.
153185900532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153185900532 is an abundant number, since it is smaller than the sum of its proper divisors (263646493068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153185900532 is a wasteful number, since it uses less digits than its factorization.
153185900532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37217205 (or 37217189 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 153185900532 in words is "one hundred fifty-three billion, one hundred eighty-five million, nine hundred thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •