Base | Representation |
---|---|
bin | 11101011101001011111… |
… | …11001001111110000101 |
3 | 10120202102010200100221102 |
4 | 32232211333021332011 |
5 | 113040241120023414 |
6 | 2052541524425445 |
7 | 133056555666545 |
oct | 16564577117605 |
9 | 3522363610842 |
10 | 1012102111109 |
11 | 360259290111 |
12 | 14419ab48285 |
13 | 74596632a2b |
14 | 36db3845325 |
15 | 1b4d8e56ede |
hex | eba5fc9f85 |
1012102111109 has 2 divisors, whose sum is σ = 1012102111110. Its totient is φ = 1012102111108.
The previous prime is 1012102111103. The next prime is 1012102111271. The reversal of 1012102111109 is 9011112012101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 776249102500 + 235853008609 = 881050^2 + 485647^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012102111109 - 28 = 1012102110853 is a prime.
It is a super-2 number, since 2×10121021111092 (a number of 25 digits) contains 22 as substring.
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 (1012102111103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506051055554 + 506051055555.
It is an arithmetic number, because the mean of its divisors is an integer number (506051055555).
Almost surely, 21012102111109 is an apocalyptic number.
It is an amenable number.
1012102111109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012102111109 is an equidigital number, since it uses as much as digits as its factorization.
1012102111109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
It can be divided in two parts, 1012102 and 111109, that added together give a palindrome (1123211).
The spelling of 1012102111109 in words is "one trillion, twelve billion, one hundred two million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •