Base | Representation |
---|---|
bin | 110001011000111110… |
… | …110000000000000100 |
3 | 12001212220220200212121 |
4 | 301120332300000010 |
5 | 1332102301431400 |
6 | 40210205255324 |
7 | 3555123255655 |
oct | 613076600004 |
9 | 161786820777 |
10 | 53032452100 |
11 | 20544489211 |
12 | a340564544 |
13 | 50020a7394 |
14 | 27d138352c |
15 | 15a5be921a |
hex | c58fb0004 |
53032452100 has 36 divisors (see below), whose sum is σ = 115109386000. Its totient is φ = 21207641760.
The previous prime is 53032452097. The next prime is 53032452103. The reversal of 53032452100 is 125423035.
It is an interprime number because it is at equal distance from previous prime (53032452097) and next prime (53032452103).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (53032452103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 345211 + ... + 474589.
Almost surely, 253032452100 is an apocalyptic number.
53032452100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53032452100 is an abundant number, since it is smaller than the sum of its proper divisors (62076933900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53032452100 is a wasteful number, since it uses less digits than its factorization.
53032452100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133492 (or 133485 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 53032452100 its reverse (125423035), we get a palindrome (53157875135).
The spelling of 53032452100 in words is "fifty-three billion, thirty-two million, four hundred fifty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.821 sec. • engine limits •