Base | Representation |
---|---|
bin | 1011110101111011110010… |
… | …1010110101110000101101 |
3 | 1201002211000121011012102122 |
4 | 2331132330222311300231 |
5 | 3201314420033033122 |
6 | 43405510054402325 |
7 | 2512515516120065 |
oct | 275367452656055 |
9 | 51084017135378 |
10 | 13021211221037 |
11 | 41702a02aa038 |
12 | 15637213603a5 |
13 | 735b83285a96 |
14 | 33033111c3a5 |
15 | 178aa1908142 |
hex | bd7bcab5c2d |
13021211221037 has 2 divisors, whose sum is σ = 13021211221038. Its totient is φ = 13021211221036.
The previous prime is 13021211221033. The next prime is 13021211221099. The reversal of 13021211221037 is 73012211212031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12054409026916 + 966802194121 = 3471946^2 + 983261^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021211221037 - 22 = 13021211221033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13021211220997 and 13021211221015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13021211221033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510605610518 + 6510605610519.
It is an arithmetic number, because the mean of its divisors is an integer number (6510605610519).
Almost surely, 213021211221037 is an apocalyptic number.
It is an amenable number.
13021211221037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021211221037 is an equidigital number, since it uses as much as digits as its factorization.
13021211221037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 13021211221037 its reverse (73012211212031), we get a palindrome (86033422433068).
The spelling of 13021211221037 in words is "thirteen trillion, twenty-one billion, two hundred eleven million, two hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •