Base | Representation |
---|---|
bin | 1100000111011000101011… |
… | …0010101100101101001011 |
3 | 1202011110212221021110102202 |
4 | 3001312022302230231023 |
5 | 3221222423131143034 |
6 | 44155332034550415 |
7 | 2543261226604541 |
oct | 301661262545513 |
9 | 52143787243382 |
10 | 13321022131019 |
11 | 4276460795199 |
12 | 15b185343840b |
13 | 758222b7a1b5 |
14 | 340a530bbd91 |
15 | 18179c6b547e |
hex | c1d8acacb4b |
13321022131019 has 2 divisors, whose sum is σ = 13321022131020. Its totient is φ = 13321022131018.
The previous prime is 13321022130929. The next prime is 13321022131037. The reversal of 13321022131019 is 91013122012331.
13321022131019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13321022131019 is a prime.
It is a super-2 number, since 2×133210221310192 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13321022130982 and 13321022131000.
It is not a weakly prime, because it can be changed into another prime (13321022133019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660511065509 + 6660511065510.
It is an arithmetic number, because the mean of its divisors is an integer number (6660511065510).
Almost surely, 213321022131019 is an apocalyptic number.
13321022131019 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321022131019 is an equidigital number, since it uses as much as digits as its factorization.
13321022131019 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 13321022131019 in words is "thirteen trillion, three hundred twenty-one billion, twenty-two million, one hundred thirty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •