Base | Representation |
---|---|
bin | 100111000010001… |
… | …1101010000100101 |
3 | 10101021121021211202 |
4 | 1032010131100211 |
5 | 10140301310034 |
6 | 333545212245 |
7 | 44313020303 |
oct | 11604352045 |
9 | 3337537752 |
10 | 1309791269 |
11 | 612385626 |
12 | 306791085 |
13 | 17b485827 |
14 | c5d4d273 |
15 | 79ec647e |
hex | 4e11d425 |
1309791269 has 2 divisors, whose sum is σ = 1309791270. Its totient is φ = 1309791268.
The previous prime is 1309791233. The next prime is 1309791271. The reversal of 1309791269 is 9621979031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1069944100 + 239847169 = 32710^2 + 15487^2 .
It is a cyclic number.
It is not a de Polignac number, because 1309791269 - 224 = 1293014053 is a prime.
It is a super-2 number, since 2×13097912692 = 3431106336697260722, which contains 22 as substring.
Together with 1309791271, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1309796269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 654895634 + 654895635.
It is an arithmetic number, because the mean of its divisors is an integer number (654895635).
Almost surely, 21309791269 is an apocalyptic number.
It is an amenable number.
1309791269 is a deficient number, since it is larger than the sum of its proper divisors (1).
1309791269 is an equidigital number, since it uses as much as digits as its factorization.
1309791269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 47.
The square root of 1309791269 is about 36191.0385178431. The cubic root of 1309791269 is about 1094.1260637326.
The spelling of 1309791269 in words is "one billion, three hundred nine million, seven hundred ninety-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.472 sec. • engine limits •