Base | Representation |
---|---|
bin | 1011111011110000101110… |
… | …1111001111010110110001 |
3 | 1201110101102111021211110121 |
4 | 2332330023233033112301 |
5 | 3204434431414203241 |
6 | 43523504020330241 |
7 | 2522661406645312 |
oct | 276741357172661 |
9 | 51411374254417 |
10 | 13121322022321 |
11 | 41a97a3233847 |
12 | 157b000243981 |
13 | 742448a1b4c6 |
14 | 33510ab82609 |
15 | 17b4b072cad1 |
hex | bef0bbcf5b1 |
13121322022321 has 2 divisors, whose sum is σ = 13121322022322. Its totient is φ = 13121322022320.
The previous prime is 13121322022313. The next prime is 13121322022331. The reversal of 13121322022321 is 12322022312131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11199463833600 + 1921858188721 = 3346560^2 + 1386311^2 .
It is a cyclic number.
It is not a de Polignac number, because 13121322022321 - 23 = 13121322022313 is a prime.
It is a super-2 number, since 2×131213220223212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13121322022301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560661011160 + 6560661011161.
It is an arithmetic number, because the mean of its divisors is an integer number (6560661011161).
Almost surely, 213121322022321 is an apocalyptic number.
It is an amenable number.
13121322022321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13121322022321 is an equidigital number, since it uses as much as digits as its factorization.
13121322022321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13121322022321 its reverse (12322022312131), we get a palindrome (25443344334452).
The spelling of 13121322022321 in words is "thirteen trillion, one hundred twenty-one billion, three hundred twenty-two million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •