Base | Representation |
---|---|
bin | 1011110101111111111110… |
… | …0010000101100101010101 |
3 | 1201002220220202222110220102 |
4 | 2331133333202011211111 |
5 | 3201324214222000041 |
6 | 43410213250143445 |
7 | 2512555360101542 |
oct | 275377742054525 |
9 | 51086822873812 |
10 | 13022333000021 |
11 | 417081653a204 |
12 | 1563994b81b85 |
13 | 7360017c0827 |
14 | 3303da0c9bc9 |
15 | 178b1a14209b |
hex | bd7ff885955 |
13022333000021 has 2 divisors, whose sum is σ = 13022333000022. Its totient is φ = 13022333000020.
The previous prime is 13022332999981. The next prime is 13022333000059. The reversal of 13022333000021 is 12000033322031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12394729978225 + 627603021796 = 3520615^2 + 792214^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13022333000021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13022332999957 and 13022333000002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13022333050021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511166500010 + 6511166500011.
It is an arithmetic number, because the mean of its divisors is an integer number (6511166500011).
Almost surely, 213022333000021 is an apocalyptic number.
It is an amenable number.
13022333000021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022333000021 is an equidigital number, since it uses as much as digits as its factorization.
13022333000021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13022333000021 its reverse (12000033322031), we get a palindrome (25022366322052).
The spelling of 13022333000021 in words is "thirteen trillion, twenty-two billion, three hundred thirty-three million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •