Base | Representation |
---|---|
bin | 101001111001111… |
… | …1011100010001101 |
3 | 10121222212101221020 |
4 | 1103303323202031 |
5 | 10334431402000 |
6 | 351310024353 |
7 | 46562561262 |
oct | 12363734215 |
9 | 3558771836 |
10 | 1406122125 |
11 | 6617a0401 |
12 | 332aa80b9 |
13 | 195413235 |
14 | d4a67269 |
15 | 836a3ba0 |
hex | 53cfb88d |
1406122125 has 32 divisors (see below), whose sum is σ = 2366133120. Its totient is φ = 741488000.
The previous prime is 1406122111. The next prime is 1406122129. The reversal of 1406122125 is 5212216041.
It is not a de Polignac number, because 1406122125 - 26 = 1406122061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1406122095 and 1406122104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1406122129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12310 + ... + 54440.
It is an arithmetic number, because the mean of its divisors is an integer number (73941660).
Almost surely, 21406122125 is an apocalyptic number.
1406122125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1406122125 is a deficient number, since it is larger than the sum of its proper divisors (960010995).
1406122125 is an equidigital number, since it uses as much as digits as its factorization.
1406122125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42238 (or 42228 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 1406122125 is about 37498.2949612379. The cubic root of 1406122125 is about 1120.3172265206.
Adding to 1406122125 its reverse (5212216041), we get a palindrome (6618338166).
The spelling of 1406122125 in words is "one billion, four hundred six million, one hundred twenty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •