Base | Representation |
---|---|
bin | 110100110001010101… |
… | …1001001000001011101 |
3 | 101211111210021110212212 |
4 | 1221202223021001131 |
5 | 3324042101013023 |
6 | 124021032010205 |
7 | 11121201266444 |
oct | 1514253110135 |
9 | 354453243785 |
10 | 113324626013 |
11 | 44073884915 |
12 | 19b68230965 |
13 | a8c0222131 |
14 | 56b096dd5b |
15 | 2e33e11e78 |
hex | 1a62ac905d |
113324626013 has 2 divisors, whose sum is σ = 113324626014. Its totient is φ = 113324626012.
The previous prime is 113324625991. The next prime is 113324626027. The reversal of 113324626013 is 310626423311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62011956484 + 51312669529 = 249022^2 + 226523^2 .
It is a cyclic number.
It is not a de Polignac number, because 113324626013 - 26 = 113324625949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113324625013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56662313006 + 56662313007.
It is an arithmetic number, because the mean of its divisors is an integer number (56662313007).
Almost surely, 2113324626013 is an apocalyptic number.
It is an amenable number.
113324626013 is a deficient number, since it is larger than the sum of its proper divisors (1).
113324626013 is an equidigital number, since it uses as much as digits as its factorization.
113324626013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 113324626013 in words is "one hundred thirteen billion, three hundred twenty-four million, six hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •