Base | Representation |
---|---|
bin | 101010010100111… |
… | …0101010101101101 |
3 | 10122222110022012101 |
4 | 1110221311111231 |
5 | 10402041040100 |
6 | 352532535101 |
7 | 50123642626 |
oct | 12451652555 |
9 | 3588408171 |
10 | 1420252525 |
11 | 66977181a |
12 | 337781491 |
13 | 19831cb13 |
14 | d68a4a4d |
15 | 84a4586a |
hex | 54a7556d |
1420252525 has 24 divisors (see below), whose sum is σ = 1825630920. Its totient is φ = 1094741760.
The previous prime is 1420252517. The next prime is 1420252541. The reversal of 1420252525 is 5252520241.
It can be written as a sum of positive squares in 12 ways, for example, as 295186761 + 1125065764 = 17181^2 + 33542^2 .
It is not a de Polignac number, because 1420252525 - 23 = 1420252517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1420252493 and 1420252502.
It is a congruent number.
It is an unprimeable number.
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, 402067 + ... + 405583.
It is an arithmetic number, because the mean of its divisors is an integer number (76067955).
Almost surely, 21420252525 is an apocalyptic number.
It is an amenable number.
1420252525 is a deficient number, since it is larger than the sum of its proper divisors (405378395).
1420252525 is a wasteful number, since it uses less digits than its factorization.
1420252525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4113 (or 4108 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 1420252525 is about 37686.2378727301. The cubic root of 1420252525 is about 1124.0574887855.
Adding to 1420252525 its reverse (5252520241), we get a palindrome (6672772766).
The spelling of 1420252525 in words is "one billion, four hundred twenty million, two hundred fifty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •