Base | Representation |
---|---|
bin | 11001000001000001000011… |
… | …111100100101111110101011 |
3 | 112102112220111012112210121221 |
4 | 121001001003330211332223 |
5 | 103410041023141241021 |
6 | 1025554543154442511 |
7 | 32113520331415441 |
oct | 3101010374457653 |
9 | 472486435483557 |
10 | 110021022212011 |
11 | 32068720884229 |
12 | 1040a989893437 |
13 | 4950c26692471 |
14 | 1d2508dcb6b91 |
15 | cabd7509b241 |
hex | 641043f25fab |
110021022212011 has 8 divisors (see below), whose sum is σ = 113399640538848. Its totient is φ = 106693210176000.
The previous prime is 110021022211981. The next prime is 110021022212083. The reversal of 110021022212011 is 110212220120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110021022212011 - 25 = 110021022211979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110021022216011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12701568310 + ... + 12701576971.
It is an arithmetic number, because the mean of its divisors is an integer number (14174955067356).
Almost surely, 2110021022212011 is an apocalyptic number.
110021022212011 is a deficient number, since it is larger than the sum of its proper divisors (3378618326837).
110021022212011 is an equidigital number, since it uses as much as digits as its factorization.
110021022212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25403145413.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110021022212011 its reverse (110212220120011), we get a palindrome (220233242332022).
The spelling of 110021022212011 in words is "one hundred ten trillion, twenty-one billion, twenty-two million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •