Base | Representation |
---|---|
bin | 110100101011001111… |
… | …0100100001111001101 |
3 | 101210222112020112220112 |
4 | 1221112132210033031 |
5 | 3323132210044041 |
6 | 123544442125405 |
7 | 11113135106114 |
oct | 1512636441715 |
9 | 353875215815 |
10 | 113120003021 |
11 | 43a79324603 |
12 | 19b0b7b0865 |
13 | a889a0983c |
14 | 5691706c7b |
15 | 2e20e92deb |
hex | 1a567a43cd |
113120003021 has 2 divisors, whose sum is σ = 113120003022. Its totient is φ = 113120003020.
The previous prime is 113120002993. The next prime is 113120003027. The reversal of 113120003021 is 120300021311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71315702500 + 41804300521 = 267050^2 + 204461^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113120003021 is a prime.
It is a super-2 number, since 2×1131200030212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113120002987 and 113120003005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113120003027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56560001510 + 56560001511.
It is an arithmetic number, because the mean of its divisors is an integer number (56560001511).
Almost surely, 2113120003021 is an apocalyptic number.
It is an amenable number.
113120003021 is a deficient number, since it is larger than the sum of its proper divisors (1).
113120003021 is an equidigital number, since it uses as much as digits as its factorization.
113120003021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 113120003021 its reverse (120300021311), we get a palindrome (233420024332).
The spelling of 113120003021 in words is "one hundred thirteen billion, one hundred twenty million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •