Base | Representation |
---|---|
bin | 1001110010001110… |
… | …11010000011110000 |
3 | 111120002211201212101 |
4 | 10321013122003300 |
5 | 41224310212402 |
6 | 2225134310144 |
7 | 244115360035 |
oct | 47107320360 |
9 | 14502751771 |
10 | 5253210352 |
11 | 2256333765 |
12 | 1027358354 |
13 | 6594565c0 |
14 | 37b97538c |
15 | 20b2c1b87 |
hex | 1391da0f0 |
5253210352 has 40 divisors (see below), whose sum is σ = 10979002160. Its totient is φ = 2420582400.
The previous prime is 5253210349. The next prime is 5253210359. The reversal of 5253210352 is 2530123525.
It is a self number, because there is not a number n which added to its sum of digits gives 5253210352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5253210359) 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, 108352 + ... + 149152.
It is an arithmetic number, because the mean of its divisors is an integer number (274475054).
Almost surely, 25253210352 is an apocalyptic number.
5253210352 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5253210352 is an abundant number, since it is smaller than the sum of its proper divisors (5725791808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5253210352 is a wasteful number, since it uses less digits than its factorization.
5253210352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41441 (or 41435 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5253210352 is about 72479.0338787708. The cubic root of 5253210352 is about 1738.3675127686.
Adding to 5253210352 its reverse (2530123525), we get a palindrome (7783333877).
The spelling of 5253210352 in words is "five billion, two hundred fifty-three million, two hundred ten thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •