Base | Representation |
---|---|
bin | 110100111110110011… |
… | …1011010100010100101 |
3 | 101212200021210212022012 |
4 | 1221331213122202211 |
5 | 3331003304242041 |
6 | 124133540044005 |
7 | 11135330301161 |
oct | 1517547324245 |
9 | 355607725265 |
10 | 113776634021 |
11 | 44285a42156 |
12 | 1a073693605 |
13 | a962a72aab |
14 | 57149d1ca1 |
15 | 2e5d94a3eb |
hex | 1a7d9da8a5 |
113776634021 has 4 divisors (see below), whose sum is σ = 113859502572. Its totient is φ = 113693765472.
The previous prime is 113776634011. The next prime is 113776634051. The reversal of 113776634021 is 120436677311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97194921121 + 16581712900 = 311761^2 + 128770^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113776634021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 113776634021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113776634011) 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, 41432216 + ... + 41434961.
It is an arithmetic number, because the mean of its divisors is an integer number (28464875643).
Almost surely, 2113776634021 is an apocalyptic number.
It is an amenable number.
113776634021 is a deficient number, since it is larger than the sum of its proper divisors (82868551).
113776634021 is an equidigital number, since it uses as much as digits as its factorization.
113776634021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82868550.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 113776634021 in words is "one hundred thirteen billion, seven hundred seventy-six million, six hundred thirty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •