Base | Representation |
---|---|
bin | 1010000110001110101000… |
… | …0010111001101110001001 |
3 | 1110022100111222102222211201 |
4 | 2201203222002321232021 |
5 | 2423344121230401441 |
6 | 35340124451024201 |
7 | 2224046635663642 |
oct | 241435202715611 |
9 | 43270458388751 |
10 | 11102122122121 |
11 | 35a0424562848 |
12 | 12b37ba29b061 |
13 | 626c05798954 |
14 | 2a54ba3a06c9 |
15 | 143bd1d7ac31 |
hex | a18ea0b9b89 |
11102122122121 has 2 divisors, whose sum is σ = 11102122122122. Its totient is φ = 11102122122120.
The previous prime is 11102122122089. The next prime is 11102122122131. The reversal of 11102122122121 is 12122122120111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5700848646025 + 5401273476096 = 2387645^2 + 2324064^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102122122121 - 25 = 11102122122089 is a prime.
It is a super-2 number, since 2×111021221221212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11102122122131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551061061060 + 5551061061061.
It is an arithmetic number, because the mean of its divisors is an integer number (5551061061061).
Almost surely, 211102122122121 is an apocalyptic number.
It is an amenable number.
11102122122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102122122121 is an equidigital number, since it uses as much as digits as its factorization.
11102122122121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11102122122121 its reverse (12122122120111), we get a palindrome (23224244242232).
The spelling of 11102122122121 in words is "eleven trillion, one hundred two billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •