Base | Representation |
---|---|
bin | 1100000110110100001000… |
… | …0001000111101111110001 |
3 | 1202010112120012100120122202 |
4 | 3001231002001013233301 |
5 | 3221042330034143213 |
6 | 44151030325312545 |
7 | 2542463136451151 |
oct | 301550201075761 |
9 | 52115505316582 |
10 | 13311211240433 |
11 | 42722867a4957 |
12 | 15ab975865755 |
13 | 75731b402cb2 |
14 | 3403a2104761 |
15 | 1813c620eb58 |
hex | c1b42047bf1 |
13311211240433 has 2 divisors, whose sum is σ = 13311211240434. Its totient is φ = 13311211240432.
The previous prime is 13311211240381. The next prime is 13311211240451. The reversal of 13311211240433 is 33404211211331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7519622449249 + 5791588791184 = 2742193^2 + 2406572^2 .
It is a cyclic number.
It is not a de Polignac number, because 13311211240433 - 214 = 13311211224049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13311211240396 and 13311211240405.
It is not a weakly prime, because it can be changed into another prime (13311211240333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655605620216 + 6655605620217.
It is an arithmetic number, because the mean of its divisors is an integer number (6655605620217).
Almost surely, 213311211240433 is an apocalyptic number.
It is an amenable number.
13311211240433 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311211240433 is an equidigital number, since it uses as much as digits as its factorization.
13311211240433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 13311211240433 its reverse (33404211211331), we get a palindrome (46715422451764).
The spelling of 13311211240433 in words is "thirteen trillion, three hundred eleven billion, two hundred eleven million, two hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •