Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111001001011001110001 |
3 | 10220011100100121021212222 |
4 | 100000132113021121301 |
5 | 121010320334341311 |
6 | 2201202003530425 |
7 | 142321355220155 |
oct | 20003627113161 |
9 | 3804310537788 |
10 | 1100021012081 |
11 | 394575202752 |
12 | 159236989a15 |
13 | 7c968254264 |
14 | 3b3541b7065 |
15 | 1d932751adb |
hex | 1001e5c9671 |
1100021012081 has 2 divisors, whose sum is σ = 1100021012082. Its totient is φ = 1100021012080.
The previous prime is 1100021012059. The next prime is 1100021012093. The reversal of 1100021012081 is 1802101200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 722882550625 + 377138461456 = 850225^2 + 614116^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100021012081 - 26 = 1100021012017 is a prime.
It is a super-2 number, since 2×11000210120812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100021012011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550010506040 + 550010506041.
It is an arithmetic number, because the mean of its divisors is an integer number (550010506041).
Almost surely, 21100021012081 is an apocalyptic number.
It is an amenable number.
1100021012081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100021012081 is an equidigital number, since it uses as much as digits as its factorization.
1100021012081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1100021012081 its reverse (1802101200011), we get a palindrome (2902122212092).
The spelling of 1100021012081 in words is "one trillion, one hundred billion, twenty-one million, twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •