Base | Representation |
---|---|
bin | 1011111100011101011001… |
… | …0110101101111000100001 |
3 | 1201111112101001020101221121 |
4 | 2333013112112231320201 |
5 | 3210134010143200301 |
6 | 43533205424252241 |
7 | 2523564461106055 |
oct | 277072626557041 |
9 | 51445331211847 |
10 | 13133311303201 |
11 | 4203895933a41 |
12 | 15813a7471081 |
13 | 74360989c04b |
14 | 3359271adc65 |
15 | 17b9630823a1 |
hex | bf1d65ade21 |
13133311303201 has 2 divisors, whose sum is σ = 13133311303202. Its totient is φ = 13133311303200.
The previous prime is 13133311303159. The next prime is 13133311303271. The reversal of 13133311303201 is 10230311333131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12229288761600 + 904022541601 = 3497040^2 + 950801^2 .
It is an emirp because it is prime and its reverse (10230311333131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13133311303201 - 215 = 13133311270433 is a prime.
It is not a weakly prime, because it can be changed into another prime (13133311303271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6566655651600 + 6566655651601.
It is an arithmetic number, because the mean of its divisors is an integer number (6566655651601).
Almost surely, 213133311303201 is an apocalyptic number.
It is an amenable number.
13133311303201 is a deficient number, since it is larger than the sum of its proper divisors (1).
13133311303201 is an equidigital number, since it uses as much as digits as its factorization.
13133311303201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13133311303201 its reverse (10230311333131), we get a palindrome (23363622636332).
The spelling of 13133311303201 in words is "thirteen trillion, one hundred thirty-three billion, three hundred eleven million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •