Base | Representation |
---|---|
bin | 101001111001111… |
… | …1010010100010001 |
3 | 10121222212011002111 |
4 | 1103303322110101 |
5 | 10334431222022 |
6 | 351305545321 |
7 | 46562540605 |
oct | 12363722421 |
9 | 3558764074 |
10 | 1406117137 |
11 | 661797687 |
12 | 332aa5241 |
13 | 195410b99 |
14 | d4a65505 |
15 | 836a2477 |
hex | 53cfa511 |
1406117137 has 4 divisors (see below), whose sum is σ = 1413972720. Its totient is φ = 1398261556.
The previous prime is 1406117093. The next prime is 1406117149. The reversal of 1406117137 is 7317116041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 7317116041 = 37 ⋅197759893.
It is a cyclic number.
It is not a de Polignac number, because 1406117137 - 211 = 1406115089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1406117099 and 1406117108.
It is not an unprimeable number, because it can be changed into a prime (1406117197) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3927523 + ... + 3927880.
It is an arithmetic number, because the mean of its divisors is an integer number (353493180).
Almost surely, 21406117137 is an apocalyptic number.
It is an amenable number.
1406117137 is a deficient number, since it is larger than the sum of its proper divisors (7855583).
1406117137 is an equidigital number, since it uses as much as digits as its factorization.
1406117137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7855582.
The product of its (nonzero) digits is 3528, while the sum is 31.
The square root of 1406117137 is about 37498.2284514882. The cubic root of 1406117137 is about 1120.3159018019.
The spelling of 1406117137 in words is "one billion, four hundred six million, one hundred seventeen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •