Base | Representation |
---|---|
bin | 1011110101011101100111… |
… | …1111110000110000000101 |
3 | 1201002001010020111201010112 |
4 | 2331113121333300300011 |
5 | 3201201324001411323 |
6 | 43402050340202405 |
7 | 2512111036035452 |
oct | 275273177606005 |
9 | 51061106451115 |
10 | 13013113310213 |
11 | 4167915237855 |
12 | 1562041399405 |
13 | 735192681083 |
14 | 32dba3848829 |
15 | 17877aa1c178 |
hex | bd5d9ff0c05 |
13013113310213 has 2 divisors, whose sum is σ = 13013113310214. Its totient is φ = 13013113310212.
The previous prime is 13013113310177. The next prime is 13013113310261. The reversal of 13013113310213 is 31201331131031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12974533672324 + 38579637889 = 3602018^2 + 196417^2 .
It is a cyclic number.
It is not a de Polignac number, because 13013113310213 - 238 = 12738235403269 is a prime.
It is a super-2 number, since 2×130131133102132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13013133310213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6506556655106 + 6506556655107.
It is an arithmetic number, because the mean of its divisors is an integer number (6506556655107).
Almost surely, 213013113310213 is an apocalyptic number.
It is an amenable number.
13013113310213 is a deficient number, since it is larger than the sum of its proper divisors (1).
13013113310213 is an equidigital number, since it uses as much as digits as its factorization.
13013113310213 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 23.
Adding to 13013113310213 its reverse (31201331131031), we get a palindrome (44214444441244).
The spelling of 13013113310213 in words is "thirteen trillion, thirteen billion, one hundred thirteen million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •