Base | Representation |
---|---|
bin | 1100000001101010001001… |
… | …0000011000011100100111 |
3 | 1201211001220221000120222022 |
4 | 3000122202100120130213 |
5 | 3213114422133244034 |
6 | 44042220523053355 |
7 | 2533206064436162 |
oct | 300324220303447 |
9 | 51731827016868 |
10 | 13222631540519 |
11 | 4238760878295 |
12 | 159677467125b |
13 | 74bb7291938b |
14 | 339d9bac0ad9 |
15 | 17de3e8d7b2e |
hex | c06a2418727 |
13222631540519 has 2 divisors, whose sum is σ = 13222631540520. Its totient is φ = 13222631540518.
The previous prime is 13222631540507. The next prime is 13222631540549. The reversal of 13222631540519 is 91504513622231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13222631540519 - 220 = 13222630491943 is a prime.
It is a super-2 number, since 2×132226315405192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13222631540519.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13222631540549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6611315770259 + 6611315770260.
It is an arithmetic number, because the mean of its divisors is an integer number (6611315770260).
Almost surely, 213222631540519 is an apocalyptic number.
13222631540519 is a deficient number, since it is larger than the sum of its proper divisors (1).
13222631540519 is an equidigital number, since it uses as much as digits as its factorization.
13222631540519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 44.
The spelling of 13222631540519 in words is "thirteen trillion, two hundred twenty-two billion, six hundred thirty-one million, five hundred forty thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •