Base | Representation |
---|---|
bin | 111100100011110… |
… | …010110100001001 |
3 | 2121210210222010022 |
4 | 330203302310021 |
5 | 4040100004022 |
6 | 244452430225 |
7 | 34114665113 |
oct | 7443626411 |
9 | 2553728108 |
10 | 1016016137 |
11 | 481572a64 |
12 | 244318375 |
13 | 1326571a6 |
14 | 98d1a3b3 |
15 | 5e2e6c42 |
hex | 3c8f2d09 |
1016016137 has 4 divisors (see below), whose sum is σ = 1016167440. Its totient is φ = 1015864836.
The previous prime is 1016016119. The next prime is 1016016149. The reversal of 1016016137 is 7316106101.
1016016137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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: 7316106101 = 233 ⋅31399597.
It is a cyclic number.
It is not a de Polignac number, because 1016016137 - 214 = 1015999753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1016016107) 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, 65087 + ... + 79172.
It is an arithmetic number, because the mean of its divisors is an integer number (254041860).
Almost surely, 21016016137 is an apocalyptic number.
It is an amenable number.
1016016137 is a deficient number, since it is larger than the sum of its proper divisors (151303).
1016016137 is an equidigital number, since it uses as much as digits as its factorization.
1016016137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151302.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 1016016137 is about 31875.0080313715. The cubic root of 1016016137 is about 1005.3104614128.
The spelling of 1016016137 in words is "one billion, sixteen million, sixteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •