Base | Representation |
---|---|
bin | 11001000100000111110010… |
… | …100001000101011101010111 |
3 | 112110022022021011210122100012 |
4 | 121010013302201011131113 |
5 | 103422040030012124343 |
6 | 1030240553011510435 |
7 | 32135113206242501 |
oct | 3104076241053527 |
9 | 473268234718305 |
10 | 110234404411223 |
11 | 3214016a5377a4 |
12 | 104441babb841b |
13 | 49680a13014c1 |
14 | 1d315333b2d71 |
15 | cb26b32bb718 |
hex | 6441f2845757 |
110234404411223 has 32 divisors (see below), whose sum is σ = 114748645186560. Its totient is φ = 105821467839360.
The previous prime is 110234404411169. The next prime is 110234404411249. The reversal of 110234404411223 is 322114404432011.
It is a cyclic number.
It is not a de Polignac number, because 110234404411223 - 216 = 110234404345687 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110234404411223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110234404411283) 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, 7449773261 + ... + 7449788057.
It is an arithmetic number, because the mean of its divisors is an integer number (3585895162080).
Almost surely, 2110234404411223 is an apocalyptic number.
110234404411223 is a deficient number, since it is larger than the sum of its proper divisors (4514240775337).
110234404411223 is a wasteful number, since it uses less digits than its factorization.
110234404411223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24807.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 110234404411223 its reverse (322114404432011), we get a palindrome (432348808843234).
The spelling of 110234404411223 in words is "one hundred ten trillion, two hundred thirty-four billion, four hundred four million, four hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •