Base | Representation |
---|---|
bin | 110100101110100001… |
… | …1011100000001101101 |
3 | 101211021012211211211111 |
4 | 1221131003130001231 |
5 | 3323343431111023 |
6 | 124003422552021 |
7 | 11115644641021 |
oct | 1513503340155 |
9 | 354235754744 |
10 | 113230332013 |
11 | 44025630397 |
12 | 19b40738611 |
13 | a8a6828876 |
14 | 56a2226381 |
15 | 2e2a9d800d |
hex | 1a5d0dc06d |
113230332013 has 2 divisors, whose sum is σ = 113230332014. Its totient is φ = 113230332012.
The previous prime is 113230331993. The next prime is 113230332031. The reversal of 113230332013 is 310233032311.
Together with next prime (113230332031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94385357284 + 18844974729 = 307222^2 + 137277^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113230332013 is a prime.
It is a super-2 number, since 2×1132303320132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113230332043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56615166006 + 56615166007.
It is an arithmetic number, because the mean of its divisors is an integer number (56615166007).
Almost surely, 2113230332013 is an apocalyptic number.
It is an amenable number.
113230332013 is a deficient number, since it is larger than the sum of its proper divisors (1).
113230332013 is an equidigital number, since it uses as much as digits as its factorization.
113230332013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 113230332013 its reverse (310233032311), we get a palindrome (423463364324).
The spelling of 113230332013 in words is "one hundred thirteen billion, two hundred thirty million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •