Base | Representation |
---|---|
bin | 100101000011011… |
… | …0101010001000101 |
3 | 10012122111102212102 |
4 | 1022012311101011 |
5 | 10021241230104 |
6 | 323212201445 |
7 | 42544630001 |
oct | 11206652105 |
9 | 3178442772 |
10 | 1243305029 |
11 | 5888a451a |
12 | 2a8469285 |
13 | 16a777465 |
14 | bb1a3701 |
15 | 74241a1e |
hex | 4a1b5445 |
1243305029 has 2 divisors, whose sum is σ = 1243305030. Its totient is φ = 1243305028.
The previous prime is 1243305001. The next prime is 1243305031. The reversal of 1243305029 is 9205033421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1202216929 + 41088100 = 34673^2 + 6410^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1243305029 is a prime.
Together with 1243305031, 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 = 1243304992 and 1243305010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1243305059) 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, 621652514 + 621652515.
It is an arithmetic number, because the mean of its divisors is an integer number (621652515).
Almost surely, 21243305029 is an apocalyptic number.
It is an amenable number.
1243305029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1243305029 is an equidigital number, since it uses as much as digits as its factorization.
1243305029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 1243305029 is about 35260.5307532374. The cubic root of 1243305029 is about 1075.2907175508.
The spelling of 1243305029 in words is "one billion, two hundred forty-three million, three hundred five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •