Base | Representation |
---|---|
bin | 10010111100100101111… |
… | …110011000001111111101 |
3 | 11121110201110122210121121 |
4 | 102330211332120033331 |
5 | 132313010110344213 |
6 | 2434045224030541 |
7 | 163032035044444 |
oct | 22744576301775 |
9 | 4543643583547 |
10 | 1302012199933 |
11 | 4621a8a41845 |
12 | 190409302451 |
13 | 95a18c537a3 |
14 | 470368dbd5b |
15 | 23d058e788d |
hex | 12f25f983fd |
1302012199933 has 2 divisors, whose sum is σ = 1302012199934. Its totient is φ = 1302012199932.
The previous prime is 1302012199897. The next prime is 1302012199949. The reversal of 1302012199933 is 3399912102031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1260639419524 + 41372780409 = 1122782^2 + 203403^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302012199933 - 29 = 1302012199421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1302012199933.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302012199133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651006099966 + 651006099967.
It is an arithmetic number, because the mean of its divisors is an integer number (651006099967).
Almost surely, 21302012199933 is an apocalyptic number.
It is an amenable number.
1302012199933 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302012199933 is an equidigital number, since it uses as much as digits as its factorization.
1302012199933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 43.
The spelling of 1302012199933 in words is "one trillion, three hundred two billion, twelve million, one hundred ninety-nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •