Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1011010000100100001 |
3 | 101211110021221220222001 |
4 | 1221201121122010201 |
5 | 3324021104400113 |
6 | 124014544444001 |
7 | 11120521211152 |
oct | 1514131320441 |
9 | 354407856861 |
10 | 113303200033 |
11 | 440627801a1 |
12 | 19b61019601 |
13 | a8b895c93a |
14 | 56abb93929 |
15 | 2e320cd7dd |
hex | 1a6165a121 |
113303200033 has 2 divisors, whose sum is σ = 113303200034. Its totient is φ = 113303200032.
The previous prime is 113303200027. The next prime is 113303200037. The reversal of 113303200033 is 330002303311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110272477329 + 3030722704 = 332073^2 + 55052^2 .
It is a cyclic number.
It is not a de Polignac number, because 113303200033 - 29 = 113303199521 is a prime.
It is a super-2 number, since 2×1133032000332 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113303200037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56651600016 + 56651600017.
It is an arithmetic number, because the mean of its divisors is an integer number (56651600017).
Almost surely, 2113303200033 is an apocalyptic number.
It is an amenable number.
113303200033 is a deficient number, since it is larger than the sum of its proper divisors (1).
113303200033 is an equidigital number, since it uses as much as digits as its factorization.
113303200033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 113303200033 its reverse (330002303311), we get a palindrome (443305503344).
The spelling of 113303200033 in words is "one hundred thirteen billion, three hundred three million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •