Base | Representation |
---|---|
bin | 110011001110010100… |
… | …1000110001001110001 |
3 | 101111221020112210212001 |
4 | 1212130221012021301 |
5 | 3300241030414301 |
6 | 122311224534001 |
7 | 10642646165644 |
oct | 1463451061161 |
9 | 344836483761 |
10 | 110002201201 |
11 | 42719413992 |
12 | 1939b621301 |
13 | a4b0abaaa9 |
14 | 54775d7a5b |
15 | 2cdc3cec01 |
hex | 199ca46271 |
110002201201 has 2 divisors, whose sum is σ = 110002201202. Its totient is φ = 110002201200.
The previous prime is 110002201181. The next prime is 110002201289. The reversal of 110002201201 is 102102200011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95698041201 + 14304160000 = 309351^2 + 119600^2 .
It is a cyclic number.
It is not a de Polignac number, because 110002201201 - 27 = 110002201073 is a prime.
It is not a weakly prime, because it can be changed into another prime (110002202201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001100600 + 55001100601.
It is an arithmetic number, because the mean of its divisors is an integer number (55001100601).
Almost surely, 2110002201201 is an apocalyptic number.
It is an amenable number.
110002201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002201201 is an equidigital number, since it uses as much as digits as its factorization.
110002201201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110002201201 its reverse (102102200011), we get a palindrome (212104401212).
The spelling of 110002201201 in words is "one hundred ten billion, two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •