Base | Representation |
---|---|
bin | 101010000101100… |
… | …1011000101010111 |
3 | 10122102022221221222 |
4 | 1110023023011113 |
5 | 10343011341002 |
6 | 352044400555 |
7 | 46665426161 |
oct | 12413130527 |
9 | 3572287858 |
10 | 1412215127 |
11 | 665182144 |
12 | 334b4615b |
13 | 19676766b |
14 | d57b1931 |
15 | 83ea91a2 |
hex | 542cb157 |
1412215127 has 8 divisors (see below), whose sum is σ = 1425567264. Its totient is φ = 1398878208.
The previous prime is 1412215121. The next prime is 1412215151. The reversal of 1412215127 is 7215122141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1412215127 is a prime.
It is a super-2 number, since 2×14122151272 = 3988703129855252258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1412215096 and 1412215105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412215121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 280343 + ... + 285335.
It is an arithmetic number, because the mean of its divisors is an integer number (178195908).
Almost surely, 21412215127 is an apocalyptic number.
1412215127 is a deficient number, since it is larger than the sum of its proper divisors (13352137).
1412215127 is a wasteful number, since it uses less digits than its factorization.
1412215127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7609.
The product of its digits is 1120, while the sum is 26.
The square root of 1412215127 is about 37579.4508608096. The cubic root of 1412215127 is about 1121.9330793322.
Adding to 1412215127 its reverse (7215122141), we get a palindrome (8627337268).
The spelling of 1412215127 in words is "one billion, four hundred twelve million, two hundred fifteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •