Base | Representation |
---|---|
bin | 110000110100101110… |
… | …110110011100010010 |
3 | 12000022112120121001210 |
4 | 300310232312130102 |
5 | 1324331110220102 |
6 | 40030002440550 |
7 | 3534060143421 |
oct | 606456663422 |
9 | 160275517053 |
10 | 52424304402 |
11 | 20262175908 |
12 | a1b0963156 |
13 | 4c360b8082 |
14 | 27746b92b8 |
15 | 156c61c36c |
hex | c34bb6712 |
52424304402 has 8 divisors (see below), whose sum is σ = 104848608816. Its totient is φ = 17474768132.
The previous prime is 52424304371. The next prime is 52424304403. The reversal of 52424304402 is 20440342425.
52424304402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
52424304402 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 52424304402.
It is not an unprimeable number, because it can be changed into a prime (52424304403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4368692028 + ... + 4368692039.
It is an arithmetic number, because the mean of its divisors is an integer number (13106076102).
Almost surely, 252424304402 is an apocalyptic number.
52424304402 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52424304402 is a wasteful number, since it uses less digits than its factorization.
52424304402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8737384072.
The product of its (nonzero) digits is 30720, while the sum is 30.
Adding to 52424304402 its reverse (20440342425), we get a palindrome (72864646827).
The spelling of 52424304402 in words is "fifty-two billion, four hundred twenty-four million, three hundred four thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •