Base | Representation |
---|---|
bin | 10000010011011001000… |
… | …100000010100111001011 |
3 | 10222002202221120222001122 |
4 | 100103121010002213023 |
5 | 121323420300241412 |
6 | 2214401324505455 |
7 | 143640621115214 |
oct | 20233104024713 |
9 | 3862687528048 |
10 | 1120333212107 |
11 | 3a214898921a |
12 | 1611653ab28b |
13 | 8185450ba25 |
14 | 3c31db2a40b |
15 | 1e220adb572 |
hex | 104d91029cb |
1120333212107 has 2 divisors, whose sum is σ = 1120333212108. Its totient is φ = 1120333212106.
The previous prime is 1120333212017. The next prime is 1120333212109. The reversal of 1120333212107 is 7012123330211.
Together with previous prime (1120333212017) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1120333212107 - 230 = 1119259470283 is a prime.
It is a super-2 number, since 2×11203332121072 (a number of 25 digits) contains 22 as substring.
Together with 1120333212109, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1120333212109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560166606053 + 560166606054.
It is an arithmetic number, because the mean of its divisors is an integer number (560166606054).
Almost surely, 21120333212107 is an apocalyptic number.
1120333212107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120333212107 is an equidigital number, since it uses as much as digits as its factorization.
1120333212107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 1120333212107 its reverse (7012123330211), we get a palindrome (8132456542318).
The spelling of 1120333212107 in words is "one trillion, one hundred twenty billion, three hundred thirty-three million, two hundred twelve thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •