Base | Representation |
---|---|
bin | 100001100001110… |
… | …1100100011110101 |
3 | 2220101222002001211 |
4 | 1003003230203311 |
5 | 4301002324141 |
6 | 303345321421 |
7 | 36610463026 |
oct | 10303544365 |
9 | 2811862054 |
10 | 1125042421 |
11 | 52806a028 |
12 | 274936271 |
13 | 14c10b299 |
14 | a95bac4d |
15 | 68b80d81 |
hex | 430ec8f5 |
1125042421 has 24 divisors (see below), whose sum is σ = 1233830400. Its totient is φ = 1024604640.
The previous prime is 1125042409. The next prime is 1125042433. The reversal of 1125042421 is 1242405211.
It is an interprime number because it is at equal distance from previous prime (1125042409) and next prime (1125042433).
It is not a de Polignac number, because 1125042421 - 25 = 1125042389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1125042392 and 1125042401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125042481) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2562520 + ... + 2562958.
It is an arithmetic number, because the mean of its divisors is an integer number (51409600).
Almost surely, 21125042421 is an apocalyptic number.
It is an amenable number.
1125042421 is a deficient number, since it is larger than the sum of its proper divisors (108787979).
1125042421 is a wasteful number, since it uses less digits than its factorization.
1125042421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737 (or 718 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 1125042421 is about 33541.6520314668. The cubic root of 1125042421 is about 1040.0549838410.
Adding to 1125042421 its reverse (1242405211), we get a palindrome (2367447632).
The spelling of 1125042421 in words is "one billion, one hundred twenty-five million, forty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •