Base | Representation |
---|---|
bin | 1100000111011001110100… |
… | …1101010100110101011101 |
3 | 1202011111200110122202121011 |
4 | 3001312131031110311131 |
5 | 3221224041230213041 |
6 | 44155422433135221 |
7 | 2543302001033656 |
oct | 301663515246535 |
9 | 52144613582534 |
10 | 13321331101021 |
11 | 42765aa1359a9 |
12 | 15b191a9ba511 |
13 | 758271b98a98 |
14 | 340a8214852d |
15 | 1817b9896e81 |
hex | c1d9d354d5d |
13321331101021 has 2 divisors, whose sum is σ = 13321331101022. Its totient is φ = 13321331101020.
The previous prime is 13321331101009. The next prime is 13321331101061. The reversal of 13321331101021 is 12010113312331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8917754760121 + 4403576340900 = 2986261^2 + 2098470^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321331101021 - 217 = 13321330969949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13321331100983 and 13321331101001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13321331101061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660665550510 + 6660665550511.
It is an arithmetic number, because the mean of its divisors is an integer number (6660665550511).
Almost surely, 213321331101021 is an apocalyptic number.
It is an amenable number.
13321331101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321331101021 is an equidigital number, since it uses as much as digits as its factorization.
13321331101021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13321331101021 its reverse (12010113312331), we get a palindrome (25331444413352).
The spelling of 13321331101021 in words is "thirteen trillion, three hundred twenty-one billion, three hundred thirty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •