Base | Representation |
---|---|
bin | 1001110010101001… |
… | …00001111010110101 |
3 | 111120100022111202100 |
4 | 10321110201322311 |
5 | 41231200303141 |
6 | 2225340132313 |
7 | 244156535301 |
oct | 47124417265 |
9 | 14510274670 |
10 | 5256650421 |
11 | 22582732a0 |
12 | 1028537099 |
13 | 65a08c349 |
14 | 37c1ccd01 |
15 | 20b7510b6 |
hex | 139521eb5 |
5256650421 has 48 divisors (see below), whose sum is σ = 8539023168. Its totient is φ = 3088108800.
The previous prime is 5256650411. The next prime is 5256650507. The reversal of 5256650421 is 1240566525.
5256650421 is a `hidden beast` number, since 5 + 2 + 566 + 50 + 42 + 1 = 666.
It is not a de Polignac number, because 5256650421 - 210 = 5256649397 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5256650411) 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 47 ways as a sum of consecutive naturals, for example, 1026750 + ... + 1031856.
It is an arithmetic number, because the mean of its divisors is an integer number (177896316).
Almost surely, 25256650421 is an apocalyptic number.
It is an amenable number.
5256650421 is a deficient number, since it is larger than the sum of its proper divisors (3282372747).
5256650421 is a wasteful number, since it uses less digits than its factorization.
5256650421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5442 (or 5439 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The square root of 5256650421 is about 72502.7614715467. The cubic root of 5256650421 is about 1738.7468870881.
It can be divided in two parts, 52566504 and 21, that added together give a palindrome (52566525).
The spelling of 5256650421 in words is "five billion, two hundred fifty-six million, six hundred fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •