Base | Representation |
---|---|
bin | 1111100111100… |
… | …10011111001001 |
3 | 100010112100001111 |
4 | 13303302133021 |
5 | 232020013044 |
6 | 21000050321 |
7 | 3150423511 |
oct | 763623711 |
9 | 303470044 |
10 | 131016649 |
11 | 67a56825 |
12 | 37a639a1 |
13 | 211b345a |
14 | 13586841 |
15 | b77eb34 |
hex | 7cf27c9 |
131016649 has 2 divisors, whose sum is σ = 131016650. Its totient is φ = 131016648.
The previous prime is 131016643. The next prime is 131016653. The reversal of 131016649 is 946610131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127848249 + 3168400 = 11307^2 + 1780^2 .
It is a cyclic number.
It is not a de Polignac number, because 131016649 - 25 = 131016617 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131016649.
It is not a weakly prime, because it can be changed into another prime (131016643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65508324 + 65508325.
It is an arithmetic number, because the mean of its divisors is an integer number (65508325).
Almost surely, 2131016649 is an apocalyptic number.
It is an amenable number.
131016649 is a deficient number, since it is larger than the sum of its proper divisors (1).
131016649 is an equidigital number, since it uses as much as digits as its factorization.
131016649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 131016649 is about 11446.2504340941. The cubic root of 131016649 is about 507.8968224642.
The spelling of 131016649 in words is "one hundred thirty-one million, sixteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •