Base | Representation |
---|---|
bin | 110100101000000011… |
… | …1100111100101010111 |
3 | 101210201002111200222002 |
4 | 1221100013213211113 |
5 | 3322422402332434 |
6 | 123530111425515 |
7 | 11110401255653 |
oct | 1512007474527 |
9 | 353632450862 |
10 | 113013324119 |
11 | 43a24091123 |
12 | 19a9bb2529b |
13 | a870898027 |
14 | 5681497a63 |
15 | 2e1691e57e |
hex | 1a501e7957 |
113013324119 has 2 divisors, whose sum is σ = 113013324120. Its totient is φ = 113013324118.
The previous prime is 113013324107. The next prime is 113013324121. The reversal of 113013324119 is 911423310311.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113013324119 - 212 = 113013320023 is a prime.
It is a super-4 number, since 4×1130133241194 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
Together with 113013324121, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 113013324091 and 113013324100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113013321119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56506662059 + 56506662060.
It is an arithmetic number, because the mean of its divisors is an integer number (56506662060).
Almost surely, 2113013324119 is an apocalyptic number.
113013324119 is a deficient number, since it is larger than the sum of its proper divisors (1).
113013324119 is an equidigital number, since it uses as much as digits as its factorization.
113013324119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 113013324119 in words is "one hundred thirteen billion, thirteen million, three hundred twenty-four thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •