Base | Representation |
---|---|
bin | 1011110101111011110010… |
… | …1010110101110000101001 |
3 | 1201002211000121011012102111 |
4 | 2331132330222311300221 |
5 | 3201314420033033113 |
6 | 43405510054402321 |
7 | 2512515516120061 |
oct | 275367452656051 |
9 | 51084017135374 |
10 | 13021211221033 |
11 | 41702a02aa034 |
12 | 15637213603a1 |
13 | 735b83285a92 |
14 | 33033111c3a1 |
15 | 178aa190813d |
hex | bd7bcab5c29 |
13021211221033 has 2 divisors, whose sum is σ = 13021211221034. Its totient is φ = 13021211221032.
The previous prime is 13021211221027. The next prime is 13021211221037. The reversal of 13021211221033 is 33012211212031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12979785946009 + 41425275024 = 3602747^2 + 203532^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13021211221033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13021211220995 and 13021211221013.
It is not a weakly prime, because it can be changed into another prime (13021211221037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510605610516 + 6510605610517.
It is an arithmetic number, because the mean of its divisors is an integer number (6510605610517).
Almost surely, 213021211221033 is an apocalyptic number.
It is an amenable number.
13021211221033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021211221033 is an equidigital number, since it uses as much as digits as its factorization.
13021211221033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13021211221033 its reverse (33012211212031), we get a palindrome (46033422433064).
The spelling of 13021211221033 in words is "thirteen trillion, twenty-one billion, two hundred eleven million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •