Base | Representation |
---|---|
bin | 110100101011101000… |
… | …1010111011110110111 |
3 | 101211000110022010112101 |
4 | 1221113101113132313 |
5 | 3323144112220434 |
6 | 123550035402531 |
7 | 11113356232351 |
oct | 1512721273667 |
9 | 354013263471 |
10 | 113133320119 |
11 | 43a8589a976 |
12 | 19b14153447 |
13 | a88c6c0191 |
14 | 56933b20d1 |
15 | 2e22223b14 |
hex | 1a574577b7 |
113133320119 has 4 divisors (see below), whose sum is σ = 113143550080. Its totient is φ = 113123090160.
The previous prime is 113133320117. The next prime is 113133320123. The reversal of 113133320119 is 911023331311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911023331311 = 23 ⋅39609710057.
It is a cyclic number.
It is not a de Polignac number, because 113133320119 - 21 = 113133320117 is a prime.
It is a super-2 number, since 2×1131333201192 (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 (113133320117) 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, 5098374 + ... + 5120515.
It is an arithmetic number, because the mean of its divisors is an integer number (28285887520).
Almost surely, 2113133320119 is an apocalyptic number.
113133320119 is a deficient number, since it is larger than the sum of its proper divisors (10229961).
113133320119 is a wasteful number, since it uses less digits than its factorization.
113133320119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10229960.
The product of its (nonzero) digits is 1458, while the sum is 28.
The spelling of 113133320119 in words is "one hundred thirteen billion, one hundred thirty-three million, three hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •