Base | Representation |
---|---|
bin | 1010000001011101000110… |
… | …1111111010010101111111 |
3 | 1110000111211102101020000002 |
4 | 2200113101233322111333 |
5 | 2421023141142042002 |
6 | 35234322501024515 |
7 | 2215114413256664 |
oct | 240272157722577 |
9 | 43014742336002 |
10 | 11020110112127 |
11 | 3569669956896 |
12 | 129b9306b513b |
13 | 61c26587309c |
14 | 2a153a321a6b |
15 | 1419d1e26002 |
hex | a05d1bfa57f |
11020110112127 has 4 divisors (see below), whose sum is σ = 11020158772680. Its totient is φ = 11020061451576.
The previous prime is 11020110112111. The next prime is 11020110112129. The reversal of 11020110112127 is 72121101102011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11020110112127 - 24 = 11020110112111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020110112099 and 11020110112108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020110112129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23988977 + ... + 24444042.
It is an arithmetic number, because the mean of its divisors is an integer number (2755039693170).
Almost surely, 211020110112127 is an apocalyptic number.
11020110112127 is a deficient number, since it is larger than the sum of its proper divisors (48660553).
11020110112127 is an equidigital number, since it uses as much as digits as its factorization.
11020110112127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48660552.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 11020110112127 its reverse (72121101102011), we get a palindrome (83141211214138).
The spelling of 11020110112127 in words is "eleven trillion, twenty billion, one hundred ten million, one hundred twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •