Base | Representation |
---|---|
bin | 1011111100010010001101… |
… | …1110011101110111101111 |
3 | 1201111020121220011020021111 |
4 | 2333010203132131313233 |
5 | 3210111333403304403 |
6 | 43531551540412451 |
7 | 2523430220213206 |
oct | 277044336356757 |
9 | 51436556136244 |
10 | 13130310213103 |
11 | 4202595899596 |
12 | 15808aa3a7127 |
13 | 74324bbc55a5 |
14 | 3357207a223d |
15 | 17b83987556d |
hex | bf12379ddef |
13130310213103 has 2 divisors, whose sum is σ = 13130310213104. Its totient is φ = 13130310213102.
The previous prime is 13130310213091. The next prime is 13130310213109. The reversal of 13130310213103 is 30131201303131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13130310213103 - 225 = 13130276658671 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130310213109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565155106551 + 6565155106552.
It is an arithmetic number, because the mean of its divisors is an integer number (6565155106552).
Almost surely, 213130310213103 is an apocalyptic number.
13130310213103 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130310213103 is an equidigital number, since it uses as much as digits as its factorization.
13130310213103 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 22.
Adding to 13130310213103 its reverse (30131201303131), we get a palindrome (43261511516234).
The spelling of 13130310213103 in words is "thirteen trillion, one hundred thirty billion, three hundred ten million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •