Base | Representation |
---|---|
bin | 1011111011110100011000… |
… | …1101100001101111000101 |
3 | 1201110110221212020201100111 |
4 | 2332331012031201233011 |
5 | 3204443434034243303 |
6 | 43524145223113021 |
7 | 2523024621320425 |
oct | 276750615415705 |
9 | 51413855221314 |
10 | 13122303040453 |
11 | 41aa156a72232 |
12 | 157b2348a2771 |
13 | 7425740407c9 |
14 | 3351a118c485 |
15 | 17b51b90eb6d |
hex | bef46361bc5 |
13122303040453 has 2 divisors, whose sum is σ = 13122303040454. Its totient is φ = 13122303040452.
The previous prime is 13122303040421. The next prime is 13122303040459. The reversal of 13122303040453 is 35404030322131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13033240784964 + 89062255489 = 3610158^2 + 298433^2 .
It is an emirp because it is prime and its reverse (35404030322131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13122303040453 - 25 = 13122303040421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13122303040459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6561151520226 + 6561151520227.
It is an arithmetic number, because the mean of its divisors is an integer number (6561151520227).
Almost surely, 213122303040453 is an apocalyptic number.
It is an amenable number.
13122303040453 is a deficient number, since it is larger than the sum of its proper divisors (1).
13122303040453 is an equidigital number, since it uses as much as digits as its factorization.
13122303040453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 13122303040453 its reverse (35404030322131), we get a palindrome (48526333362584).
The spelling of 13122303040453 in words is "thirteen trillion, one hundred twenty-two billion, three hundred three million, forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •