Base | Representation |
---|---|
bin | 11001000001000000001110… |
… | …001011000000110001011001 |
3 | 112102112211011022220210201222 |
4 | 121001000032023000301121 |
5 | 103410032201211201410 |
6 | 1025554313445421425 |
7 | 32113456065056246 |
oct | 3101001613006131 |
9 | 472484138823658 |
10 | 110020120022105 |
11 | 320682a8596637 |
12 | 1040a77770a875 |
13 | 4950b117b0097 |
14 | 1d2500614a5cd |
15 | cabd20c8a955 |
hex | 64100e2c0c59 |
110020120022105 has 8 divisors (see below), whose sum is σ = 133385217676872. Its totient is φ = 87108713584128.
The previous prime is 110020120022081. The next prime is 110020120022161. The reversal of 110020120022105 is 501220021020011.
It can be written as a sum of positive squares in 4 ways, for example, as 9998400064 + 110010121622041 = 99992^2 + 10488571^2 .
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 110020120022105 - 212 = 110020120018009 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113422803662 + ... + 113422804631.
It is an arithmetic number, because the mean of its divisors is an integer number (16673152209609).
Almost surely, 2110020120022105 is an apocalyptic number.
It is an amenable number.
110020120022105 is a deficient number, since it is larger than the sum of its proper divisors (23365097654767).
110020120022105 is an equidigital number, since it uses as much as digits as its factorization.
110020120022105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226845608395.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 110020120022105 its reverse (501220021020011), we get a palindrome (611240141042116).
The spelling of 110020120022105 in words is "one hundred ten trillion, twenty billion, one hundred twenty million, twenty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •