Base | Representation |
---|---|
bin | 1011110100110000100000… |
… | …0011110001011011011101 |
3 | 1201000212212010110100102002 |
4 | 2331030020003301123131 |
5 | 3201002022302232423 |
6 | 43352324424012045 |
7 | 2511201633636602 |
oct | 275141003613335 |
9 | 51025763410362 |
10 | 13001001211613 |
11 | 416276a280908 |
12 | 155b821001025 |
13 | 733cb222ac1c |
14 | 32d374daa6a9 |
15 | 1782bc507228 |
hex | bd3080f16dd |
13001001211613 has 2 divisors, whose sum is σ = 13001001211614. Its totient is φ = 13001001211612.
The previous prime is 13001001211577. The next prime is 13001001211621. The reversal of 13001001211613 is 31611210010031.
13001001211613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10016129939929 + 2984871271684 = 3164827^2 + 1727678^2 .
It is a cyclic number.
It is not a de Polignac number, because 13001001211613 - 232 = 12996706244317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13001001211643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6500500605806 + 6500500605807.
It is an arithmetic number, because the mean of its divisors is an integer number (6500500605807).
Almost surely, 213001001211613 is an apocalyptic number.
It is an amenable number.
13001001211613 is a deficient number, since it is larger than the sum of its proper divisors (1).
13001001211613 is an equidigital number, since it uses as much as digits as its factorization.
13001001211613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13001001211613 its reverse (31611210010031), we get a palindrome (44612211221644).
The spelling of 13001001211613 in words is "thirteen trillion, one billion, one million, two hundred eleven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •