Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101001001001000101001 |
3 | 10220011022120212212102211 |
4 | 100000131231021020221 |
5 | 121010310030012222 |
6 | 2201200531525121 |
7 | 142321162506541 |
oct | 20003555111051 |
9 | 3804276785384 |
10 | 1100010000937 |
11 | 394569a71931 |
12 | 1592331597a1 |
13 | 7c965b9a3a3 |
14 | 3b35294c321 |
15 | 1d9317c9277 |
hex | 1001db49229 |
1100010000937 has 2 divisors, whose sum is σ = 1100010000938. Its totient is φ = 1100010000936.
The previous prime is 1100010000923. The next prime is 1100010000967. The reversal of 1100010000937 is 7390000100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1068279347776 + 31730653161 = 1033576^2 + 178131^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100010000937 - 223 = 1100001612329 is a prime.
It is a super-2 number, since 2×11000100009372 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100010000907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550005000468 + 550005000469.
It is an arithmetic number, because the mean of its divisors is an integer number (550005000469).
Almost surely, 21100010000937 is an apocalyptic number.
It is an amenable number.
1100010000937 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100010000937 is an equidigital number, since it uses as much as digits as its factorization.
1100010000937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189, while the sum is 22.
Adding to 1100010000937 its reverse (7390000100011), we get a palindrome (8490010100948).
The spelling of 1100010000937 in words is "one trillion, one hundred billion, ten million, nine hundred thirty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •