Base | Representation |
---|---|
bin | 1100000110110111110100… |
… | …1000011011001111001101 |
3 | 1202010122010022112202010202 |
4 | 3001231331020123033031 |
5 | 3221101342432323041 |
6 | 44151312554343245 |
7 | 2542526541405455 |
oct | 301557510331715 |
9 | 52118108482122 |
10 | 13312203011021 |
11 | 4272745607872 |
12 | 15abbb1a2ab25 |
13 | 757448a1b4b5 |
14 | 340457b0cd65 |
15 | 181433317a9b |
hex | c1b7d21b3cd |
13312203011021 has 2 divisors, whose sum is σ = 13312203011022. Its totient is φ = 13312203011020.
The previous prime is 13312203010999. The next prime is 13312203011033. The reversal of 13312203011021 is 12011030221331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12262112992900 + 1050090018121 = 3501730^2 + 1024739^2 .
It is a cyclic number.
It is not a de Polignac number, because 13312203011021 - 226 = 13312135902157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13312203010984 and 13312203011002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13312203014021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656101505510 + 6656101505511.
It is an arithmetic number, because the mean of its divisors is an integer number (6656101505511).
Almost surely, 213312203011021 is an apocalyptic number.
It is an amenable number.
13312203011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312203011021 is an equidigital number, since it uses as much as digits as its factorization.
13312203011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13312203011021 its reverse (12011030221331), we get a palindrome (25323233232352).
The spelling of 13312203011021 in words is "thirteen trillion, three hundred twelve billion, two hundred three million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •