Base | Representation |
---|---|
bin | 100101000011011… |
… | …0111011101101101 |
3 | 10012122111220012202 |
4 | 1022012313131231 |
5 | 10021242022104 |
6 | 323212311245 |
7 | 42544665146 |
oct | 11206673555 |
9 | 3178456182 |
10 | 1243314029 |
11 | 588900261 |
12 | 2a8472525 |
13 | 16a77b599 |
14 | bb1a6acd |
15 | 7424451e |
hex | 4a1b776d |
1243314029 has 2 divisors, whose sum is σ = 1243314030. Its totient is φ = 1243314028.
The previous prime is 1243313969. The next prime is 1243314031. The reversal of 1243314029 is 9204133421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 650148004 + 593166025 = 25498^2 + 24355^2 .
It is a cyclic number.
It is not a de Polignac number, because 1243314029 - 216 = 1243248493 is a prime.
Together with 1243314031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1243313992 and 1243314010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1243314529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 621657014 + 621657015.
It is an arithmetic number, because the mean of its divisors is an integer number (621657015).
Almost surely, 21243314029 is an apocalyptic number.
It is an amenable number.
1243314029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1243314029 is an equidigital number, since it uses as much as digits as its factorization.
1243314029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 1243314029 is about 35260.6583744547. The cubic root of 1243314029 is about 1075.2933121389.
It can be divided in two parts, 12433 and 14029, that added together give a palindrome (26462).
The spelling of 1243314029 in words is "one billion, two hundred forty-three million, three hundred fourteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •