Base | Representation |
---|---|
bin | 110011010001101000… |
… | …0111100100111011111 |
3 | 101112012222121210010011 |
4 | 1212203100330213133 |
5 | 3301003001424244 |
6 | 122330234224051 |
7 | 10645465462543 |
oct | 1464320744737 |
9 | 345188553104 |
10 | 110113311199 |
11 | 42776103531 |
12 | 19410885027 |
13 | a4cab21458 |
14 | 548827ba23 |
15 | 2ce702b434 |
hex | 19a343c9df |
110113311199 has 4 divisors (see below), whose sum is σ = 113910321960. Its totient is φ = 106316300440.
The previous prime is 110113311193. The next prime is 110113311211. The reversal of 110113311199 is 991113311011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110113311199 - 27 = 110113311071 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 110113311199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110113311193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1898505337 + ... + 1898505394.
It is an arithmetic number, because the mean of its divisors is an integer number (28477580490).
Almost surely, 2110113311199 is an apocalyptic number.
110113311199 is a deficient number, since it is larger than the sum of its proper divisors (3797010761).
110113311199 is an equidigital number, since it uses as much as digits as its factorization.
110113311199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3797010760.
The product of its (nonzero) digits is 729, while the sum is 31.
The spelling of 110113311199 in words is "one hundred ten billion, one hundred thirteen million, three hundred eleven thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •