Base | Representation |
---|---|
bin | 110000110100001001… |
… | …000101010110111111 |
3 | 12000021211221121022101 |
4 | 300310021011112333 |
5 | 1324321041412111 |
6 | 40025010325531 |
7 | 3533610040363 |
oct | 606411052677 |
9 | 160254847271 |
10 | 52414404031 |
11 | 20257623590 |
12 | a1a95898a7 |
13 | 4c3402c972 |
14 | 277325d2a3 |
15 | 156b813bc1 |
hex | c342455bf |
52414404031 has 8 divisors (see below), whose sum is σ = 57296767104. Its totient is φ = 47551610520.
The previous prime is 52414404019. The next prime is 52414404079. The reversal of 52414404031 is 13040441425.
52414404031 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.
It is a cyclic number.
It is not a de Polignac number, because 52414404031 - 227 = 52280186303 is a prime.
It is a super-2 number, since 2×524144040312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52414405031) 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, 4886785 + ... + 4897498.
It is an arithmetic number, because the mean of its divisors is an integer number (7162095888).
Almost surely, 252414404031 is an apocalyptic number.
52414404031 is a deficient number, since it is larger than the sum of its proper divisors (4882363073).
52414404031 is a wasteful number, since it uses less digits than its factorization.
52414404031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9784781.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 52414404031 its reverse (13040441425), we get a palindrome (65454845456).
The spelling of 52414404031 in words is "fifty-two billion, four hundred fourteen million, four hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •