Base | Representation |
---|---|
bin | 100000110101111… |
… | …1100000011010001 |
3 | 2211210200021211122 |
4 | 1001223330003101 |
5 | 4224110142301 |
6 | 301204252025 |
7 | 36211106306 |
oct | 10153740321 |
9 | 2753607748 |
10 | 1102037201 |
11 | 516086951 |
12 | 2690a1015 |
13 | 147415025 |
14 | a650d0ad |
15 | 66b3981b |
hex | 41afc0d1 |
1102037201 has 2 divisors, whose sum is σ = 1102037202. Its totient is φ = 1102037200.
The previous prime is 1102037177. The next prime is 1102037243. The reversal of 1102037201 is 1027302011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 625750225 + 476286976 = 25015^2 + 21824^2 .
It is an emirp because it is prime and its reverse (1027302011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102037201 - 214 = 1102020817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1102037201.
It is not a weakly prime, because it can be changed into another prime (1102037501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551018600 + 551018601.
It is an arithmetic number, because the mean of its divisors is an integer number (551018601).
Almost surely, 21102037201 is an apocalyptic number.
It is an amenable number.
1102037201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102037201 is an equidigital number, since it uses as much as digits as its factorization.
1102037201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 1102037201 is about 33196.9456576957. The cubic root of 1102037201 is about 1032.9169836953.
Adding to 1102037201 its reverse (1027302011), we get a palindrome (2129339212).
The spelling of 1102037201 in words is "one billion, one hundred two million, thirty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •