Base | Representation |
---|---|
bin | 101000000110010011101… |
… | …1101001011011011110001 |
3 | 201111212010101100100110111 |
4 | 1100030213131023123301 |
5 | 1210243220340014301 |
6 | 15415433334301321 |
7 | 1106110214406352 |
oct | 120144735133361 |
9 | 21455111310414 |
10 | 5511105001201 |
11 | 183527910a7a8 |
12 | 750109ab7841 |
13 | 30c905b11667 |
14 | 150a4b7add29 |
15 | 98553235551 |
hex | 5032774b6f1 |
5511105001201 has 2 divisors, whose sum is σ = 5511105001202. Its totient is φ = 5511105001200.
The previous prime is 5511105001153. The next prime is 5511105001223. The reversal of 5511105001201 is 1021005011155.
It is an a-pointer prime, because the next prime (5511105001223) can be obtained adding 5511105001201 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4732256390625 + 778848610576 = 2175375^2 + 882524^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5511105001201 is a prime.
It is a super-2 number, since 2×55111050012012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5511105001901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2755552500600 + 2755552500601.
It is an arithmetic number, because the mean of its divisors is an integer number (2755552500601).
Almost surely, 25511105001201 is an apocalyptic number.
It is an amenable number.
5511105001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
5511105001201 is an equidigital number, since it uses as much as digits as its factorization.
5511105001201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 250, while the sum is 22.
The spelling of 5511105001201 in words is "five trillion, five hundred eleven billion, one hundred five million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •