Base | Representation |
---|---|
bin | 1011110110011101010010… |
… | …1000100110101111100101 |
3 | 1201010200020021012020012212 |
4 | 2331213110220212233211 |
5 | 3201441324011114023 |
6 | 43413554232253205 |
7 | 2513254403640224 |
oct | 275472450465745 |
9 | 51120207166185 |
10 | 13030203223013 |
11 | 4174095028229 |
12 | 1565410841205 |
13 | 736987195802 |
14 | 330945450cbb |
15 | 178e2b054e78 |
hex | bd9d4a26be5 |
13030203223013 has 2 divisors, whose sum is σ = 13030203223014. Its totient is φ = 13030203223012.
The previous prime is 13030203223007. The next prime is 13030203223097. The reversal of 13030203223013 is 31032230203031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12821713270564 + 208489952449 = 3580742^2 + 456607^2 .
It is a cyclic number.
It is not a de Polignac number, because 13030203223013 - 212 = 13030203218917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13030203223013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13030203223913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515101611506 + 6515101611507.
It is an arithmetic number, because the mean of its divisors is an integer number (6515101611507).
Almost surely, 213030203223013 is an apocalyptic number.
It is an amenable number.
13030203223013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13030203223013 is an equidigital number, since it uses as much as digits as its factorization.
13030203223013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 13030203223013 its reverse (31032230203031), we get a palindrome (44062433426044).
The spelling of 13030203223013 in words is "thirteen trillion, thirty billion, two hundred three million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •