Base | Representation |
---|---|
bin | 101001111111011… |
… | …0010010111001001 |
3 | 10122012012222221002 |
4 | 1103332302113021 |
5 | 10341143440022 |
6 | 351451024345 |
7 | 46626013553 |
oct | 12376622711 |
9 | 3565188832 |
10 | 1408968137 |
11 | 663364685 |
12 | 333a3b0b5 |
13 | 195b9b775 |
14 | d51a84d3 |
15 | 83a67092 |
hex | 53fb25c9 |
1408968137 has 2 divisors, whose sum is σ = 1408968138. Its totient is φ = 1408968136.
The previous prime is 1408968107. The next prime is 1408968149. The reversal of 1408968137 is 7318698041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 948393616 + 460574521 = 30796^2 + 21461^2 .
It is an emirp because it is prime and its reverse (7318698041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1408968137 - 228 = 1140532681 is a prime.
It is a super-2 number, since 2×14089681372 = 3970382422162501538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1408968091 and 1408968100.
It is not a weakly prime, because it can be changed into another prime (1408968107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 704484068 + 704484069.
It is an arithmetic number, because the mean of its divisors is an integer number (704484069).
Almost surely, 21408968137 is an apocalyptic number.
It is an amenable number.
1408968137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1408968137 is an equidigital number, since it uses as much as digits as its factorization.
1408968137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 290304, while the sum is 47.
The square root of 1408968137 is about 37536.2243306383. The cubic root of 1408968137 is about 1121.0725633632.
The spelling of 1408968137 in words is "one billion, four hundred eight million, nine hundred sixty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •