Base | Representation |
---|---|
bin | 1010100001110001… |
… | …11011010001011101 |
3 | 112120220100202220102 |
4 | 11100320323101131 |
5 | 43033412124141 |
6 | 2332503230445 |
7 | 260030531450 |
oct | 52070732135 |
9 | 15526322812 |
10 | 5652067421 |
11 | 2440498a00 |
12 | 1118a48425 |
13 | 6c0c878c0 |
14 | 3b891d497 |
15 | 23130b99b |
hex | 150e3b45d |
5652067421 has 24 divisors (see below), whose sum is σ = 7646295552. Its totient is φ = 4065415200.
The previous prime is 5652067417. The next prime is 5652067441. The reversal of 5652067421 is 1247602565.
It is not a de Polignac number, because 5652067421 - 22 = 5652067417 is a prime.
It is a super-2 number, since 2×56520674212 = 63891732263059182482, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5652067441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 245645 + ... + 267666.
It is an arithmetic number, because the mean of its divisors is an integer number (318595648).
Almost surely, 25652067421 is an apocalyptic number.
It is an amenable number.
5652067421 is a deficient number, since it is larger than the sum of its proper divisors (1994228131).
5652067421 is a wasteful number, since it uses less digits than its factorization.
5652067421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513353 (or 513342 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 38.
The square root of 5652067421 is about 75180.2329139781. The cubic root of 5652067421 is about 1781.2947089531.
Adding to 5652067421 its reverse (1247602565), we get a palindrome (6899669986).
The spelling of 5652067421 in words is "five billion, six hundred fifty-two million, sixty-seven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •