Base | Representation |
---|---|
bin | 10010111100111001000… |
… | …111010001110100111101 |
3 | 11121111112211212101010202 |
4 | 102330321013101310331 |
5 | 132314134311100104 |
6 | 2434141134213245 |
7 | 163043014254356 |
oct | 22747107216475 |
9 | 4544484771122 |
10 | 1302333300029 |
11 | 462353218023 |
12 | 190498954225 |
13 | 95a6a62b648 |
14 | 47067404d2d |
15 | 23d23bc351e |
hex | 12f391d1d3d |
1302333300029 has 2 divisors, whose sum is σ = 1302333300030. Its totient is φ = 1302333300028.
The previous prime is 1302333300007. The next prime is 1302333300133. The reversal of 1302333300029 is 9200033332031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 840100564900 + 462232735129 = 916570^2 + 679877^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302333300029 - 212 = 1302333295933 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1302333299974 and 1302333300010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302333300629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651166650014 + 651166650015.
It is an arithmetic number, because the mean of its divisors is an integer number (651166650015).
Almost surely, 21302333300029 is an apocalyptic number.
It is an amenable number.
1302333300029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302333300029 is an equidigital number, since it uses as much as digits as its factorization.
1302333300029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 29.
The spelling of 1302333300029 in words is "one trillion, three hundred two billion, three hundred thirty-three million, three hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •