Base | Representation |
---|---|
bin | 101010011101000… |
… | …1110110011010101 |
3 | 10200021112200202210 |
4 | 1110322032303111 |
5 | 10404141114000 |
6 | 353205024033 |
7 | 50205325164 |
oct | 12472166325 |
9 | 3607480683 |
10 | 1424551125 |
11 | 671138388 |
12 | 3390b5019 |
13 | 19919657a |
14 | d72a33db |
15 | 850e4350 |
hex | 54e8ecd5 |
1424551125 has 96 divisors (see below), whose sum is σ = 2653223040. Its totient is φ = 676339200.
The previous prime is 1424551103. The next prime is 1424551129. The reversal of 1424551125 is 5211554241.
It is not a de Polignac number, because 1424551125 - 212 = 1424547029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1424551092 and 1424551101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1424551129) 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 95 ways as a sum of consecutive naturals, for example, 2301066 + ... + 2301684.
It is an arithmetic number, because the mean of its divisors is an integer number (27637740).
Almost surely, 21424551125 is an apocalyptic number.
1424551125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1424551125 is a deficient number, since it is larger than the sum of its proper divisors (1228671915).
1424551125 is a wasteful number, since it uses less digits than its factorization.
1424551125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692 (or 663 counting only the distinct ones).
The product of its digits is 8000, while the sum is 30.
The square root of 1424551125 is about 37743.2262134545. The cubic root of 1424551125 is about 1125.1903875313.
The spelling of 1424551125 in words is "one billion, four hundred twenty-four million, five hundred fifty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •