Base | Representation |
---|---|
bin | 101001110001001… |
… | …1111010100101101 |
3 | 10121200021010022220 |
4 | 1103202133110231 |
5 | 10332244101000 |
6 | 351024025553 |
7 | 46505656653 |
oct | 12342372455 |
9 | 3550233286 |
10 | 1401550125 |
11 | 65a158398 |
12 | 3314622b9 |
13 | 1944a2201 |
14 | d41d6dd3 |
15 | 8309e1a0 |
hex | 5389f52d |
1401550125 has 32 divisors (see below), whose sum is σ = 2469377664. Its totient is φ = 703520000.
The previous prime is 1401550123. The next prime is 1401550243. The reversal of 1401550125 is 5210551041.
It is not a de Polignac number, because 1401550125 - 21 = 1401550123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1401550095 and 1401550104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401550123) 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 31 ways as a sum of consecutive naturals, for example, 103551 + ... + 116300.
It is an arithmetic number, because the mean of its divisors is an integer number (77168052).
Almost surely, 21401550125 is an apocalyptic number.
1401550125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1401550125 is a deficient number, since it is larger than the sum of its proper divisors (1067827539).
1401550125 is a wasteful number, since it uses less digits than its factorization.
1401550125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219886 (or 219876 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 1401550125 is about 37437.2825536256. The cubic root of 1401550125 is about 1119.1016725742.
The spelling of 1401550125 in words is "one billion, four hundred one million, five hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •