Base | Representation |
---|---|
bin | 1100000110001010110100… |
… | …0011111010010011010101 |
3 | 1202002110221101102120211111 |
4 | 3001202231003322103111 |
5 | 3220402122242411041 |
6 | 44141554121335021 |
7 | 2541621266442442 |
oct | 301425503722325 |
9 | 52073841376744 |
10 | 13300122232021 |
11 | 42686062a2799 |
12 | 15a97a0037471 |
13 | 756271c12b61 |
14 | 33da2d4a49c9 |
15 | 180e7793c981 |
hex | c18ad0fa4d5 |
13300122232021 has 2 divisors, whose sum is σ = 13300122232022. Its totient is φ = 13300122232020.
The previous prime is 13300122231983. The next prime is 13300122232031. The reversal of 13300122232021 is 12023222100331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11059023411121 + 2241098820900 = 3325511^2 + 1497030^2 .
It is a cyclic number.
It is not a de Polignac number, because 13300122232021 - 215 = 13300122199253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13300122231983 and 13300122232001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13300122232031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650061116010 + 6650061116011.
It is an arithmetic number, because the mean of its divisors is an integer number (6650061116011).
Almost surely, 213300122232021 is an apocalyptic number.
It is an amenable number.
13300122232021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300122232021 is an equidigital number, since it uses as much as digits as its factorization.
13300122232021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13300122232021 its reverse (12023222100331), we get a palindrome (25323344332352).
The spelling of 13300122232021 in words is "thirteen trillion, three hundred billion, one hundred twenty-two million, two hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •