Base | Representation |
---|---|
bin | 1011110101111111111011… |
… | …1000100101110101001001 |
3 | 1201002220220000111211010212 |
4 | 2331133332320211311021 |
5 | 3201324203430401212 |
6 | 43410212221050505 |
7 | 2512555165454423 |
oct | 275377670456511 |
9 | 51086800454125 |
10 | 13022322122057 |
11 | 417081038a456 |
12 | 15639913b6a35 |
13 | 735ccc482471 |
14 | 3303d8897813 |
15 | 178b191e3e22 |
hex | bd7fee25d49 |
13022322122057 has 2 divisors, whose sum is σ = 13022322122058. Its totient is φ = 13022322122056.
The previous prime is 13022322122021. The next prime is 13022322122123. The reversal of 13022322122057 is 75022122322031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7767458184256 + 5254863937801 = 2787016^2 + 2292349^2 .
It is a cyclic number.
It is not a de Polignac number, because 13022322122057 - 210 = 13022322121033 is a prime.
It is a super-2 number, since 2×130223221220572 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13022322122857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511161061028 + 6511161061029.
It is an arithmetic number, because the mean of its divisors is an integer number (6511161061029).
Almost surely, 213022322122057 is an apocalyptic number.
It is an amenable number.
13022322122057 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022322122057 is an equidigital number, since it uses as much as digits as its factorization.
13022322122057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 13022322122057 its reverse (75022122322031), we get a palindrome (88044444444088).
The spelling of 13022322122057 in words is "thirteen trillion, twenty-two billion, three hundred twenty-two million, one hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •