Base | Representation |
---|---|
bin | 101010001110000… |
… | …1101001011001001 |
3 | 10122201201210210201 |
4 | 1110130031023021 |
5 | 10400132231022 |
6 | 352324212201 |
7 | 50051403535 |
oct | 12434151311 |
9 | 3581653721 |
10 | 1416680137 |
11 | 667751834 |
12 | 33653a061 |
13 | 19766ba92 |
14 | d6214bc5 |
15 | 8458c127 |
hex | 5470d2c9 |
1416680137 has 2 divisors, whose sum is σ = 1416680138. Its totient is φ = 1416680136.
The previous prime is 1416680123. The next prime is 1416680143. The reversal of 1416680137 is 7310866141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 925437241 + 491242896 = 30421^2 + 22164^2 .
It is an emirp because it is prime and its reverse (7310866141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1416680137 is a prime.
It is a super-2 number, since 2×14166801372 = 4013965221140677538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1416680096 and 1416680105.
It is not a weakly prime, because it can be changed into another prime (1416680117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 708340068 + 708340069.
It is an arithmetic number, because the mean of its divisors is an integer number (708340069).
Almost surely, 21416680137 is an apocalyptic number.
It is an amenable number.
1416680137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1416680137 is an equidigital number, since it uses as much as digits as its factorization.
1416680137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 1416680137 is about 37638.8115779444. The cubic root of 1416680137 is about 1123.1142431446.
The spelling of 1416680137 in words is "one billion, four hundred sixteen million, six hundred eighty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •