Base | Representation |
---|---|
bin | 101010010110110… |
… | …1010011110110001 |
3 | 10200001100022120021 |
4 | 1110231222132301 |
5 | 10402320203000 |
6 | 353010243441 |
7 | 50135324215 |
oct | 12455523661 |
9 | 3601308507 |
10 | 1421256625 |
11 | 66a298158 |
12 | 337b86581 |
13 | 1985b1b69 |
14 | d6a86945 |
15 | 84b9311a |
hex | 54b6a7b1 |
1421256625 has 16 divisors (see below), whose sum is σ = 1774897488. Its totient is φ = 1136256000.
The previous prime is 1421256623. The next prime is 1421256631. The reversal of 1421256625 is 5266521241.
It can be written as a sum of positive squares in 8 ways, for example, as 1096139664 + 325116961 = 33108^2 + 18031^2 .
It is not a de Polignac number, because 1421256625 - 21 = 1421256623 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1421256623) 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 15 ways as a sum of consecutive naturals, for example, 261435 + ... + 266815.
It is an arithmetic number, because the mean of its divisors is an integer number (110931093).
Almost surely, 21421256625 is an apocalyptic number.
It is an amenable number.
1421256625 is a deficient number, since it is larger than the sum of its proper divisors (353640863).
1421256625 is an equidigital number, since it uses as much as digits as its factorization.
1421256625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7509 (or 7499 counting only the distinct ones).
The product of its digits is 28800, while the sum is 34.
The square root of 1421256625 is about 37699.5573581441. The cubic root of 1421256625 is about 1124.3223243751.
Adding to 1421256625 its reverse (5266521241), we get a palindrome (6687777866).
The spelling of 1421256625 in words is "one billion, four hundred twenty-one million, two hundred fifty-six thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •