Base | Representation |
---|---|
bin | 1011110101111111100000… |
… | …1110000110011001110111 |
3 | 1201002220121020010200112121 |
4 | 2331133320032012121313 |
5 | 3201323441320214431 |
6 | 43410153144500411 |
7 | 2512552340246035 |
oct | 275377016063167 |
9 | 51086536120477 |
10 | 13022210319991 |
11 | 4170763267954 |
12 | 156395ba7a707 |
13 | 735cb2268ab2 |
14 | 3303c7ab3555 |
15 | 178b0e4ac611 |
hex | bd7f8386677 |
13022210319991 has 2 divisors, whose sum is σ = 13022210319992. Its totient is φ = 13022210319990.
The previous prime is 13022210319961. The next prime is 13022210320079. The reversal of 13022210319991 is 19991301222031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13022210319991 - 243 = 4226117297783 is a prime.
It is a super-2 number, since 2×130222103199912 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13022210319961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511105159995 + 6511105159996.
It is an arithmetic number, because the mean of its divisors is an integer number (6511105159996).
Almost surely, 213022210319991 is an apocalyptic number.
13022210319991 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022210319991 is an equidigital number, since it uses as much as digits as its factorization.
13022210319991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 43.
The spelling of 13022210319991 in words is "thirteen trillion, twenty-two billion, two hundred ten million, three hundred nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •