Base | Representation |
---|---|
bin | 110011010000111100… |
… | …0010111110111001101 |
3 | 101112011100221010100010 |
4 | 1212201320113313031 |
5 | 3300431030420411 |
6 | 122324044423433 |
7 | 10645064225202 |
oct | 1464170276715 |
9 | 345140833303 |
10 | 110090091981 |
11 | 42763a945a1 |
12 | 19404b47b79 |
13 | a4c608197c |
14 | 5485155ca9 |
15 | 2ce4e917a6 |
hex | 19a1e17dcd |
110090091981 has 8 divisors (see below), whose sum is σ = 146957673760. Its totient is φ = 73307952432.
The previous prime is 110090091977. The next prime is 110090092019. The reversal of 110090091981 is 189190090011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110090091981 - 22 = 110090091977 is a prime.
It is a super-2 number, since 2×1100900919812 (a number of 23 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 (110090091941) 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, 21357550 + ... + 21362703.
It is an arithmetic number, because the mean of its divisors is an integer number (18369709220).
Almost surely, 2110090091981 is an apocalyptic number.
It is an amenable number.
110090091981 is a deficient number, since it is larger than the sum of its proper divisors (36867581779).
110090091981 is an equidigital number, since it uses as much as digits as its factorization.
110090091981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42721115.
The product of its (nonzero) digits is 5832, while the sum is 39.
The spelling of 110090091981 in words is "one hundred ten billion, ninety million, ninety-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •