Base | Representation |
---|---|
bin | 101000010000001… |
… | …0010011001001111 |
3 | 10111010110200110022 |
4 | 1100200102121033 |
5 | 10231231004411 |
6 | 342004532355 |
7 | 45320155352 |
oct | 12040223117 |
9 | 3433420408 |
10 | 1350641231 |
11 | 633446825 |
12 | 3183b10bb |
13 | 186a891c4 |
14 | cb544299 |
15 | 7d894edb |
hex | 5081264f |
1350641231 has 2 divisors, whose sum is σ = 1350641232. Its totient is φ = 1350641230.
The previous prime is 1350641203. The next prime is 1350641233. The reversal of 1350641231 is 1321460531.
It is a strong prime.
It is an emirp because it is prime and its reverse (1321460531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1350641231 is a prime.
It is a super-2 number, since 2×13506412312 = 3648463469754390722, which contains 22 as substring.
Together with 1350641233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1350641231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350641233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675320615 + 675320616.
It is an arithmetic number, because the mean of its divisors is an integer number (675320616).
Almost surely, 21350641231 is an apocalyptic number.
1350641231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350641231 is an equidigital number, since it uses as much as digits as its factorization.
1350641231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 1350641231 is about 36751.0711544575. The cubic root of 1350641231 is about 1105.3844082053.
The spelling of 1350641231 in words is "one billion, three hundred fifty million, six hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •