Base | Representation |
---|---|
bin | 110011010010001110… |
… | …0011100111100011011 |
3 | 101112021100212101022002 |
4 | 1212210130130330123 |
5 | 3301023033320121 |
6 | 122332222351215 |
7 | 10646125640651 |
oct | 1464434347433 |
9 | 345240771262 |
10 | 110133104411 |
11 | 427862a2460 |
12 | 1941742b50b |
13 | a501c61705 |
14 | 548ab50dd1 |
15 | 2ce8b3ae0b |
hex | 19a471cf1b |
110133104411 has 4 divisors (see below), whose sum is σ = 120145204824. Its totient is φ = 100121004000.
The previous prime is 110133104387. The next prime is 110133104437. The reversal of 110133104411 is 114401331011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114401331011 = 11 ⋅10400121001.
It is a cyclic number.
It is not a de Polignac number, because 110133104411 - 222 = 110128910107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110133104491) 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, 5006050190 + ... + 5006050211.
It is an arithmetic number, because the mean of its divisors is an integer number (30036301206).
Almost surely, 2110133104411 is an apocalyptic number.
110133104411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110133104411 is a deficient number, since it is larger than the sum of its proper divisors (10012100413).
110133104411 is a wasteful number, since it uses less digits than its factorization.
110133104411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10012100412.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 110133104411 its reverse (114401331011), we get a palindrome (224534435422).
The spelling of 110133104411 in words is "one hundred ten billion, one hundred thirty-three million, one hundred four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •