Base | Representation |
---|---|
bin | 11001110001001010111111… |
… | …000110111001110100011001 |
3 | 112212021021002102110021200222 |
4 | 121301022333012321310121 |
5 | 104323300234103031301 |
6 | 1041011103053005425 |
7 | 32604560223002150 |
oct | 3161127706716431 |
9 | 485237072407628 |
10 | 113330213330201 |
11 | 33124089a0434a |
12 | 108641a3183875 |
13 | 4b30cbb26892a |
14 | 1ddb2d6876597 |
15 | d17ea3d2d31b |
hex | 6712bf1b9d19 |
113330213330201 has 8 divisors (see below), whose sum is σ = 130802622458304. Its totient is φ = 96178398865200.
The previous prime is 113330213330197. The next prime is 113330213330221. The reversal of 113330213330201 is 102033312033311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113330213330201 - 22 = 113330213330197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (113330213330221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80148665015 + ... + 80148666428.
It is an arithmetic number, because the mean of its divisors is an integer number (16350327807288).
Almost surely, 2113330213330201 is an apocalyptic number.
It is an amenable number.
113330213330201 is a deficient number, since it is larger than the sum of its proper divisors (17472409128103).
113330213330201 is a wasteful number, since it uses less digits than its factorization.
113330213330201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160297331551.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 113330213330201 its reverse (102033312033311), we get a palindrome (215363525363512).
The spelling of 113330213330201 in words is "one hundred thirteen trillion, three hundred thirty billion, two hundred thirteen million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •