Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000010100111011011011111 |
3 | 112102212111201220122000220110 |
4 | 121002110313002213123133 |
5 | 103413024312000001343 |
6 | 1030104143423021103 |
7 | 32123154141121545 |
oct | 3102246702473337 |
9 | 472774656560813 |
10 | 110111000000223 |
11 | 320a28a3a04272 |
12 | 104242bb13a793 |
13 | 4959565a08671 |
14 | 1d29587c71d95 |
15 | cae38e4db833 |
hex | 6425370a76df |
110111000000223 has 32 divisors (see below), whose sum is σ = 153454357912320. Its totient is φ = 70159629323520.
The previous prime is 110111000000219. The next prime is 110111000000249. The reversal of 110111000000223 is 322000000111011.
It is not a de Polignac number, because 110111000000223 - 22 = 110111000000219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111000000199 and 110111000000208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110111000020223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2287336 + ... + 15015122.
It is an arithmetic number, because the mean of its divisors is an integer number (4795448684760).
Almost surely, 2110111000000223 is an apocalyptic number.
110111000000223 is a deficient number, since it is larger than the sum of its proper divisors (43343357912097).
110111000000223 is a wasteful number, since it uses less digits than its factorization.
110111000000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12729207.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 110111000000223 its reverse (322000000111011), we get a palindrome (432111000111234).
The spelling of 110111000000223 in words is "one hundred ten trillion, one hundred eleven billion, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •