Base | Representation |
---|---|
bin | 1011110101111111111110… |
… | …0010000110000100011101 |
3 | 1201002220220202222120122012 |
4 | 2331133333202012010131 |
5 | 3201324214222031023 |
6 | 43410213250201005 |
7 | 2512555360110416 |
oct | 275377742060435 |
9 | 51086822876565 |
10 | 13022333002013 |
11 | 4170816540755 |
12 | 1563994b83165 |
13 | 7360017c16ca |
14 | 3303da0ca80d |
15 | 178b1a142978 |
hex | bd7ff88611d |
13022333002013 has 2 divisors, whose sum is σ = 13022333002014. Its totient is φ = 13022333002012.
The previous prime is 13022333001991. The next prime is 13022333002033. The reversal of 13022333002013 is 31020033322031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12459897500164 + 562435501849 = 3529858^2 + 749957^2 .
It is a cyclic number.
It is not a de Polignac number, because 13022333002013 - 212 = 13022332997917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13022333002013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13022333002033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511166501006 + 6511166501007.
It is an arithmetic number, because the mean of its divisors is an integer number (6511166501007).
Almost surely, 213022333002013 is an apocalyptic number.
It is an amenable number.
13022333002013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022333002013 is an equidigital number, since it uses as much as digits as its factorization.
13022333002013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 13022333002013 its reverse (31020033322031), we get a palindrome (44042366324044).
The spelling of 13022333002013 in words is "thirteen trillion, twenty-two billion, three hundred thirty-three million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •