Base | Representation |
---|---|
bin | 1100000111010101101100… |
… | …0110100001110100111001 |
3 | 1202011101211011201202112021 |
4 | 3001311123012201310321 |
5 | 3221214303314213334 |
6 | 44155120413514441 |
7 | 2543232343031161 |
oct | 301653306416471 |
9 | 52141734652467 |
10 | 13320222022969 |
11 | 4276090090174 |
12 | 15b166b4a2a21 |
13 | 75812618a094 |
14 | 3409b8b255a1 |
15 | 18175231b3b4 |
hex | c1d5b1a1d39 |
13320222022969 has 2 divisors, whose sum is σ = 13320222022970. Its totient is φ = 13320222022968.
The previous prime is 13320222022907. The next prime is 13320222023077. The reversal of 13320222022969 is 96922022202331.
13320222022969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13253677113600 + 66544909369 = 3640560^2 + 257963^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320222022969 - 225 = 13320188468537 is a prime.
It is a super-2 number, since 2×133202220229692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13320222022169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660111011484 + 6660111011485.
It is an arithmetic number, because the mean of its divisors is an integer number (6660111011485).
Almost surely, 213320222022969 is an apocalyptic number.
It is an amenable number.
13320222022969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320222022969 is an equidigital number, since it uses as much as digits as its factorization.
13320222022969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 279936, while the sum is 43.
The spelling of 13320222022969 in words is "thirteen trillion, three hundred twenty billion, two hundred twenty-two million, twenty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •