Base | Representation |
---|---|
bin | 1011111011010001110110… |
… | …0000110101000101110111 |
3 | 1201102121000121221200210202 |
4 | 2332310131200311011313 |
5 | 3204320441224100043 |
6 | 43520013140111115 |
7 | 2522246054322653 |
oct | 276643540650567 |
9 | 51377017850722 |
10 | 13113030300023 |
11 | 41a6228826095 |
12 | 157948739549b |
13 | 741726c18254 |
14 | 33496185ba63 |
15 | 17b17780b1b8 |
hex | bed1d835177 |
13113030300023 has 2 divisors, whose sum is σ = 13113030300024. Its totient is φ = 13113030300022.
The previous prime is 13113030300001. The next prime is 13113030300047. The reversal of 13113030300023 is 32000303031131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13113030300023 - 216 = 13113030234487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13113030299968 and 13113030300004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13113030300053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556515150011 + 6556515150012.
It is an arithmetic number, because the mean of its divisors is an integer number (6556515150012).
Almost surely, 213113030300023 is an apocalyptic number.
13113030300023 is a deficient number, since it is larger than the sum of its proper divisors (1).
13113030300023 is an equidigital number, since it uses as much as digits as its factorization.
13113030300023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 13113030300023 its reverse (32000303031131), we get a palindrome (45113333331154).
The spelling of 13113030300023 in words is "thirteen trillion, one hundred thirteen billion, thirty million, three hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •