Base | Representation |
---|---|
bin | 11001000001000001001111… |
… | …101111001000111111100001 |
3 | 112102112220222222202002012111 |
4 | 121001001033233020333201 |
5 | 103410041424310341001 |
6 | 1025555014542155321 |
7 | 32113525252611004 |
oct | 3101011757107741 |
9 | 472486888662174 |
10 | 110021220012001 |
11 | 320688124a42a1 |
12 | 1040aa23b82b41 |
13 | 4950c5865928c |
14 | 1d250ac28553b |
15 | cabd8761d851 |
hex | 64104fbc8fe1 |
110021220012001 has 8 divisors (see below), whose sum is σ = 110155604180544. Its totient is φ = 109886837546640.
The previous prime is 110021220011951. The next prime is 110021220012019. The reversal of 110021220012001 is 100210022120011.
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 110021220012001 - 215 = 110021219979233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110021220612001) 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, 170838735 + ... + 171481531.
It is an arithmetic number, because the mean of its divisors is an integer number (13769450522568).
Almost surely, 2110021220012001 is an apocalyptic number.
It is an amenable number.
110021220012001 is a deficient number, since it is larger than the sum of its proper divisors (134384168543).
110021220012001 is an equidigital number, since it uses as much as digits as its factorization.
110021220012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851591.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110021220012001 its reverse (100210022120011), we get a palindrome (210231242132012).
The spelling of 110021220012001 in words is "one hundred ten trillion, twenty-one billion, two hundred twenty million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •