Base | Representation |
---|---|
bin | 1011111100010010001011… |
… | …0111111001000110010101 |
3 | 1201111020121012010111002122 |
4 | 2333010202313321012111 |
5 | 3210111323311213023 |
6 | 43531550535545325 |
7 | 2523430035235664 |
oct | 277044267710625 |
9 | 51436535114078 |
10 | 13130300101013 |
11 | 4202590112197 |
12 | 15808a6b2b245 |
13 | 743249a949c4 |
14 | 33571d2ccddb |
15 | 17b838a292c8 |
hex | bf122df9195 |
13130300101013 has 2 divisors, whose sum is σ = 13130300101014. Its totient is φ = 13130300101012.
The previous prime is 13130300100977. The next prime is 13130300101019. The reversal of 13130300101013 is 31010100303131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12016192407844 + 1114107693169 = 3466438^2 + 1055513^2 .
It is a cyclic number.
It is not a de Polignac number, because 13130300101013 - 26 = 13130300100949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13130300100982 and 13130300101000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130300101019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565150050506 + 6565150050507.
It is an arithmetic number, because the mean of its divisors is an integer number (6565150050507).
Almost surely, 213130300101013 is an apocalyptic number.
It is an amenable number.
13130300101013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130300101013 is an equidigital number, since it uses as much as digits as its factorization.
13130300101013 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 17.
Adding to 13130300101013 its reverse (31010100303131), we get a palindrome (44140400404144).
The spelling of 13130300101013 in words is "thirteen trillion, one hundred thirty billion, three hundred million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •