Base | Representation |
---|---|
bin | 110000101101010101… |
… | …011110100011101110 |
3 | 11222222220002001221000 |
4 | 300231111132203232 |
5 | 1324102323244322 |
6 | 40005411021130 |
7 | 3531022320351 |
oct | 605525364356 |
9 | 158886061830 |
10 | 52300212462 |
11 | 201a9119793 |
12 | a17729a7a6 |
13 | 4c1648a7a4 |
14 | 2762016298 |
15 | 15617a93ac |
hex | c2d55e8ee |
52300212462 has 128 divisors (see below), whose sum is σ = 125553024000. Its totient is φ = 16078030848.
The previous prime is 52300212457. The next prime is 52300212469. The reversal of 52300212462 is 26421200325.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52300212469) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12237558 + ... + 12241830.
It is an arithmetic number, because the mean of its divisors is an integer number (980883000).
Almost surely, 252300212462 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52300212462, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62776512000).
52300212462 is an abundant number, since it is smaller than the sum of its proper divisors (73252811538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52300212462 is a wasteful number, since it uses less digits than its factorization.
52300212462 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4567 (or 4561 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 52300212462 its reverse (26421200325), we get a palindrome (78721412787).
The spelling of 52300212462 in words is "fifty-two billion, three hundred million, two hundred twelve thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •