Base | Representation |
---|---|
bin | 11001000011111011100000… |
… | …110110011000101010001001 |
3 | 112110021001020112211210220112 |
4 | 121003323200312120222021 |
5 | 103421331031103244423 |
6 | 1030230533022404105 |
7 | 32134135442051003 |
oct | 3103734066305211 |
9 | 473231215753815 |
10 | 110221223103113 |
11 | 32135615a86931 |
12 | 10441740730635 |
13 | 4966a804bb3c5 |
14 | 1d30a4292d373 |
15 | cb2190ea3a78 |
hex | 643ee0d98a89 |
110221223103113 has 8 divisors (see below), whose sum is σ = 117420199629600. Its totient is φ = 103162032528768.
The previous prime is 110221223103109. The next prime is 110221223103127. The reversal of 110221223103113 is 311301322122011.
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 110221223103113 - 22 = 110221223103109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110221223103133) 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, 34946486408 + ... + 34946489561.
It is an arithmetic number, because the mean of its divisors is an integer number (14677524953700).
Almost surely, 2110221223103113 is an apocalyptic number.
It is an amenable number.
110221223103113 is a deficient number, since it is larger than the sum of its proper divisors (7198976526487).
110221223103113 is an equidigital number, since it uses as much as digits as its factorization.
110221223103113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69892976071.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 110221223103113 its reverse (311301322122011), we get a palindrome (421522545225124).
The spelling of 110221223103113 in words is "one hundred ten trillion, two hundred twenty-one billion, two hundred twenty-three million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •