Base | Representation |
---|---|
bin | 110100100111111111… |
… | …1010000011011011011 |
3 | 101210200221101100010001 |
4 | 1221033333100123123 |
5 | 3322421322211443 |
6 | 123525552433431 |
7 | 11110343526211 |
oct | 1511777203333 |
9 | 353627340101 |
10 | 113011132123 |
11 | 43a2292425a |
12 | 19a9b248877 |
13 | a8702ab3a6 |
14 | 5681086cb1 |
15 | 2e16639d4d |
hex | 1a4ffd06db |
113011132123 has 4 divisors (see below), whose sum is σ = 113012891608. Its totient is φ = 113009372640.
The previous prime is 113011131983. The next prime is 113011132147. The reversal of 113011132123 is 321231110311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113011132123 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 113011132123.
It is not an unprimeable number, because it can be changed into a prime (113011132163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 779598 + ... + 913123.
It is an arithmetic number, because the mean of its divisors is an integer number (28253222902).
Almost surely, 2113011132123 is an apocalyptic number.
113011132123 is a deficient number, since it is larger than the sum of its proper divisors (1759485).
113011132123 is an equidigital number, since it uses as much as digits as its factorization.
113011132123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759484.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 113011132123 its reverse (321231110311), we get a palindrome (434242242434).
The spelling of 113011132123 in words is "one hundred thirteen billion, eleven million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •