Base | Representation |
---|---|
bin | 110100101110100111… |
… | …0110011100100001101 |
3 | 101211021102110020121212 |
4 | 1221131032303210031 |
5 | 3323400211441023 |
6 | 124004010504205 |
7 | 11116012162043 |
oct | 1513516634415 |
9 | 354242406555 |
10 | 113233312013 |
11 | 440272862a8 |
12 | 19b41735065 |
13 | a8a7330093 |
14 | 56a27a0393 |
15 | 2e2adc5e78 |
hex | 1a5d3b390d |
113233312013 has 2 divisors, whose sum is σ = 113233312014. Its totient is φ = 113233312012.
The previous prime is 113233312007. The next prime is 113233312021. The reversal of 113233312013 is 310213332311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104621843209 + 8611468804 = 323453^2 + 92798^2 .
It is a cyclic number.
It is not a de Polignac number, because 113233312013 - 26 = 113233311949 is a prime.
It is a super-2 number, since 2×1132333120132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113233312013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113233312033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56616656006 + 56616656007.
It is an arithmetic number, because the mean of its divisors is an integer number (56616656007).
Almost surely, 2113233312013 is an apocalyptic number.
It is an amenable number.
113233312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
113233312013 is an equidigital number, since it uses as much as digits as its factorization.
113233312013 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 23.
Adding to 113233312013 its reverse (310213332311), we get a palindrome (423446644324).
The spelling of 113233312013 in words is "one hundred thirteen billion, two hundred thirty-three million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •