Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …011111011011000100011 |
3 | 10220020220102112211220021 |
4 | 100001121123323120203 |
5 | 121014333100333443 |
6 | 2201444210454311 |
7 | 142355051420665 |
oct | 20013133733043 |
9 | 3806812484807 |
10 | 1101012121123 |
11 | 394a33703632 |
12 | 159472894397 |
13 | 7ca9569a605 |
14 | 3b409a8c535 |
15 | 1d98e7789ed |
hex | 100596fb623 |
1101012121123 has 2 divisors, whose sum is σ = 1101012121124. Its totient is φ = 1101012121122.
The previous prime is 1101012121057. The next prime is 1101012121159. The reversal of 1101012121123 is 3211212101011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101012121123 - 217 = 1101011990051 is a prime.
It is a super-2 number, since 2×11010121211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101012121097 and 1101012121106.
It is not a weakly prime, because it can be changed into another prime (1101012125123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550506060561 + 550506060562.
It is an arithmetic number, because the mean of its divisors is an integer number (550506060562).
Almost surely, 21101012121123 is an apocalyptic number.
1101012121123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101012121123 is an equidigital number, since it uses as much as digits as its factorization.
1101012121123 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 16.
Adding to 1101012121123 its reverse (3211212101011), we get a palindrome (4312224222134).
The spelling of 1101012121123 in words is "one trillion, one hundred one billion, twelve million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •