Base | Representation |
---|---|
bin | 11001000010010011111001… |
… | …111111100100111011100101 |
3 | 112102212102002112101221020201 |
4 | 121002103321333210323211 |
5 | 103413020212300342011 |
6 | 1030103454034430501 |
7 | 32123116563401014 |
oct | 3102237177447345 |
9 | 472772075357221 |
10 | 110109975793381 |
11 | 320a2418857533 |
12 | 10424074132431 |
13 | 4959431774305 |
14 | 1d294cbc22a7b |
15 | cae32e627cc1 |
hex | 6424f9fe4ee5 |
110109975793381 has 8 divisors (see below), whose sum is σ = 115002631614240. Its totient is φ = 105318199474128.
The previous prime is 110109975793379. The next prime is 110109975793423. The reversal of 110109975793381 is 183397579901011.
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 110109975793381 - 21 = 110109975793379 is a prime.
It is a super-2 number, since 2×1101099757933812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110109975793361) 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, 25219873171 + ... + 25219877536.
It is an arithmetic number, because the mean of its divisors is an integer number (14375328951780).
Almost surely, 2110109975793381 is an apocalyptic number.
It is an amenable number.
110109975793381 is a deficient number, since it is larger than the sum of its proper divisors (4892655820859).
110109975793381 is an equidigital number, since it uses as much as digits as its factorization.
110109975793381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50439750803.
The product of its (nonzero) digits is 12859560, while the sum is 64.
The spelling of 110109975793381 in words is "one hundred ten trillion, one hundred nine billion, nine hundred seventy-five million, seven hundred ninety-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •