Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …010100101100011010101 |
3 | 10220100111010012121012122 |
4 | 100002111002211203111 |
5 | 121023410100023221 |
6 | 2202131332025325 |
7 | 142421613250361 |
oct | 20022502454325 |
9 | 3810433177178 |
10 | 1102012111061 |
11 | 3953a711a8a4 |
12 | 1596b1762245 |
13 | 7cbc4903034 |
14 | 3b4a27d62a1 |
15 | 1d9ec456eab |
hex | 100950a58d5 |
1102012111061 has 2 divisors, whose sum is σ = 1102012111062. Its totient is φ = 1102012111060.
The previous prime is 1102012111051. The next prime is 1102012111091. The reversal of 1102012111061 is 1601112102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1014792302161 + 87219808900 = 1007369^2 + 295330^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102012111061 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102012111051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006055530 + 551006055531.
It is an arithmetic number, because the mean of its divisors is an integer number (551006055531).
Almost surely, 21102012111061 is an apocalyptic number.
It is an amenable number.
1102012111061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102012111061 is an equidigital number, since it uses as much as digits as its factorization.
1102012111061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1102012111061 its reverse (1601112102011), we get a palindrome (2703124213072).
The spelling of 1102012111061 in words is "one trillion, one hundred two billion, twelve million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •