Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …101110000001111111001011 |
3 | 112102211200002000201220110212 |
4 | 121002030223232001333023 |
5 | 103412403321322320021 |
6 | 1030100132303431335 |
7 | 32122423440303260 |
oct | 3102145356017713 |
9 | 472750060656425 |
10 | 110102220120011 |
11 | 3209a0a8998319 |
12 | 1042266a8b554b |
13 | 4958796a38482 |
14 | 1d28d93b99267 |
15 | cae0287e085b |
hex | 64232bb81fcb |
110102220120011 has 8 divisors (see below), whose sum is σ = 128757413562624. Its totient is φ = 92178602890920.
The previous prime is 110102220119999. The next prime is 110102220120023. The reversal of 110102220120011 is 110021022201011.
It is an interprime number because it is at equal distance from previous prime (110102220119999) and next prime (110102220120023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110102220120011 - 214 = 110102220103627 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110102220120091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182894053055 + ... + 182894053656.
It is an arithmetic number, because the mean of its divisors is an integer number (16094676695328).
Almost surely, 2110102220120011 is an apocalyptic number.
110102220120011 is a deficient number, since it is larger than the sum of its proper divisors (18655193442613).
110102220120011 is an equidigital number, since it uses as much as digits as its factorization.
110102220120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365788106761.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110102220120011 its reverse (110021022201011), we get a palindrome (220123242321022).
The spelling of 110102220120011 in words is "one hundred ten trillion, one hundred two billion, two hundred twenty million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •