Base | Representation |
---|---|
bin | 100110110011100… |
… | …1100101001001001 |
3 | 10100202011121020221 |
4 | 1031213030221021 |
5 | 10131320333113 |
6 | 333112550041 |
7 | 44160563143 |
oct | 11547145111 |
9 | 3322147227 |
10 | 1302121033 |
11 | 609016894 |
12 | 3040b2321 |
13 | 1799cb525 |
14 | c4d13c93 |
15 | 794ad98d |
hex | 4d9cca49 |
1302121033 has 2 divisors, whose sum is σ = 1302121034. Its totient is φ = 1302121032.
The previous prime is 1302121027. The next prime is 1302121049. The reversal of 1302121033 is 3301212031.
It is an a-pointer prime, because the next prime (1302121049) can be obtained adding 1302121033 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1287589689 + 14531344 = 35883^2 + 3812^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302121033 - 225 = 1268566601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1302120998 and 1302121016.
It is not a weakly prime, because it can be changed into another prime (1302122033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651060516 + 651060517.
It is an arithmetic number, because the mean of its divisors is an integer number (651060517).
Almost surely, 21302121033 is an apocalyptic number.
It is an amenable number.
1302121033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302121033 is an equidigital number, since it uses as much as digits as its factorization.
1302121033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1302121033 is about 36084.9142024752. The cubic root of 1302121033 is about 1091.9861196002.
Adding to 1302121033 its reverse (3301212031), we get a palindrome (4603333064).
The spelling of 1302121033 in words is "one billion, three hundred two million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •