Base | Representation |
---|---|
bin | 100110110010101… |
… | …1011001010100111 |
3 | 10100201021222200001 |
4 | 1031211123022213 |
5 | 10131210444411 |
6 | 333055002131 |
7 | 44153616061 |
oct | 11545331247 |
9 | 3321258601 |
10 | 1301656231 |
11 | 608829657 |
12 | 303b09347 |
13 | 179897ab5 |
14 | c4c32731 |
15 | 7941adc1 |
hex | 4d95b2a7 |
1301656231 has 2 divisors, whose sum is σ = 1301656232. Its totient is φ = 1301656230.
The previous prime is 1301656193. The next prime is 1301656243. The reversal of 1301656231 is 1326561031.
It is a strong prime.
It is an emirp because it is prime and its reverse (1326561031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1301656231 - 225 = 1268101799 is a prime.
It is a super-2 number, since 2×13016562312 = 3388617887402250722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1301656231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301656261) 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, 650828115 + 650828116.
It is an arithmetic number, because the mean of its divisors is an integer number (650828116).
Almost surely, 21301656231 is an apocalyptic number.
1301656231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301656231 is an equidigital number, since it uses as much as digits as its factorization.
1301656231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 1301656231 is about 36078.4732354350. The cubic root of 1301656231 is about 1091.8561732220.
The spelling of 1301656231 in words is "one billion, three hundred one million, six hundred fifty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •