Base | Representation |
---|---|
bin | 110011001110111000… |
… | …1010001010011001011 |
3 | 101111222120011001020202 |
4 | 1212131301101103023 |
5 | 3300310401334402 |
6 | 122313142242415 |
7 | 10643266046243 |
oct | 1463561212313 |
9 | 344876131222 |
10 | 110021121227 |
11 | 42729066876 |
12 | 193a5a2640b |
13 | a4b49b3784 |
14 | 5479d20b23 |
15 | 2cdddbab02 |
hex | 199dc514cb |
110021121227 has 8 divisors (see below), whose sum is σ = 110184148800. Its totient is φ = 109858154184.
The previous prime is 110021121209. The next prime is 110021121269. The reversal of 110021121227 is 722121120011.
It is a happy number.
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 110021121227 - 26 = 110021121163 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110021121199 and 110021121208.
It is not an unprimeable number, because it can be changed into a prime (110021121827) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4662224 + ... + 4685762.
It is an arithmetic number, because the mean of its divisors is an integer number (13773018600).
Almost surely, 2110021121227 is an apocalyptic number.
110021121227 is a deficient number, since it is larger than the sum of its proper divisors (163027573).
110021121227 is an equidigital number, since it uses as much as digits as its factorization.
110021121227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30265.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 110021121227 its reverse (722121120011), we get a palindrome (832142241238).
The spelling of 110021121227 in words is "one hundred ten billion, twenty-one million, one hundred twenty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •