Base | Representation |
---|---|
bin | 1100000110001110001000… |
… | …0010010010111010111101 |
3 | 1202002120020022210201200212 |
4 | 3001203202002102322331 |
5 | 3220410432304013041 |
6 | 44142222231002205 |
7 | 2541652311033632 |
oct | 301434202227275 |
9 | 52076208721625 |
10 | 13301011001021 |
11 | 4268a21a54027 |
12 | 15a99a9809365 |
13 | 7563840a6583 |
14 | 33dab553a189 |
15 | 180eca99b8eb |
hex | c18e2092ebd |
13301011001021 has 2 divisors, whose sum is σ = 13301011001022. Its totient is φ = 13301011001020.
The previous prime is 13301011000999. The next prime is 13301011001051. The reversal of 13301011001021 is 12010011010331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8397505644025 + 4903505356996 = 2897845^2 + 2214386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13301011001021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13301011000987 and 13301011001005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13301011001051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650505500510 + 6650505500511.
It is an arithmetic number, because the mean of its divisors is an integer number (6650505500511).
Almost surely, 213301011001021 is an apocalyptic number.
It is an amenable number.
13301011001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301011001021 is an equidigital number, since it uses as much as digits as its factorization.
13301011001021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 13301011001021 its reverse (12010011010331), we get a palindrome (25311022011352).
The spelling of 13301011001021 in words is "thirteen trillion, three hundred one billion, eleven million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •