Base | Representation |
---|---|
bin | 1011111011010001110110… |
… | …0000110101000101100001 |
3 | 1201102121000121221200202221 |
4 | 2332310131200311011201 |
5 | 3204320441224100001 |
6 | 43520013140111041 |
7 | 2522246054322622 |
oct | 276643540650541 |
9 | 51377017850687 |
10 | 13113030300001 |
11 | 41a6228826075 |
12 | 1579487395481 |
13 | 741726c18238 |
14 | 33496185ba49 |
15 | 17b17780b1a1 |
hex | bed1d835161 |
13113030300001 has 2 divisors, whose sum is σ = 13113030300002. Its totient is φ = 13113030300000.
The previous prime is 13113030299969. The next prime is 13113030300023. The reversal of 13113030300001 is 10000303031131.
13113030300001 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., 8617888269376 + 4495142030625 = 2935624^2 + 2120175^2 .
It is a cyclic number.
It is not a de Polignac number, because 13113030300001 - 25 = 13113030299969 is a prime.
It is not a weakly prime, because it can be changed into another prime (13113030307001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556515150000 + 6556515150001.
It is an arithmetic number, because the mean of its divisors is an integer number (6556515150001).
Almost surely, 213113030300001 is an apocalyptic number.
It is an amenable number.
13113030300001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13113030300001 is an equidigital number, since it uses as much as digits as its factorization.
13113030300001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 13113030300001 its reverse (10000303031131), we get a palindrome (23113333331132).
The spelling of 13113030300001 in words is "thirteen trillion, one hundred thirteen billion, thirty million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •