Base | Representation |
---|---|
bin | 1011110101111011011010… |
… | …1100111111010100110001 |
3 | 1201002210202121210121021022 |
4 | 2331132312230333110301 |
5 | 3201314213421334301 |
6 | 43405452121105225 |
7 | 2512513162230611 |
oct | 275366654772461 |
9 | 51083677717238 |
10 | 13021111121201 |
11 | 417024984a5a7 |
12 | 15636b3928215 |
13 | 735b68608a01 |
14 | 330321b02a41 |
15 | 178a97c33d1b |
hex | bd7b6b3f531 |
13021111121201 has 2 divisors, whose sum is σ = 13021111121202. Its totient is φ = 13021111121200.
The previous prime is 13021111121173. The next prime is 13021111121257. The reversal of 13021111121201 is 10212111112031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11805992920225 + 1215118200976 = 3435985^2 + 1102324^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021111121201 - 238 = 12746233214257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13021111121201.
It is not a weakly prime, because it can be changed into another prime (13021111151201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510555560600 + 6510555560601.
It is an arithmetic number, because the mean of its divisors is an integer number (6510555560601).
Almost surely, 213021111121201 is an apocalyptic number.
It is an amenable number.
13021111121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021111121201 is an equidigital number, since it uses as much as digits as its factorization.
13021111121201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 13021111121201 its reverse (10212111112031), we get a palindrome (23233222233232).
The spelling of 13021111121201 in words is "thirteen trillion, twenty-one billion, one hundred eleven million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •