Base | Representation |
---|---|
bin | 11001101100101011111100… |
… | …001011100010110000000110 |
3 | 112211011210112112021200001201 |
4 | 121230223330023202300012 |
5 | 104303223024034430202 |
6 | 1040213331250213114 |
7 | 32543366346400135 |
oct | 3154537413426006 |
9 | 484153475250051 |
10 | 113022000311302 |
11 | 330153a7775425 |
12 | 1081450728419a |
13 | 4b0ac0ca31c34 |
14 | 1dca418a5991c |
15 | d0ee655e7387 |
hex | 66cafc2e2c06 |
113022000311302 has 8 divisors (see below), whose sum is σ = 169646552380656. Its totient is φ = 56473149517752.
The previous prime is 113022000311281. The next prime is 113022000311359. The reversal of 113022000311302 is 203113000220311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 113022000311302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18925315218 + ... + 18925321189.
It is an arithmetic number, because the mean of its divisors is an integer number (21205819047582).
Almost surely, 2113022000311302 is an apocalyptic number.
113022000311302 is a deficient number, since it is larger than the sum of its proper divisors (56624552069354).
113022000311302 is a wasteful number, since it uses less digits than its factorization.
113022000311302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37850637902.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113022000311302 its reverse (203113000220311), we get a palindrome (316135000531613).
Subtracting 113022000311302 from its reverse (203113000220311), we obtain a palindrome (90090999909009).
The spelling of 113022000311302 in words is "one hundred thirteen trillion, twenty-two billion, three hundred eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •