Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1001001000001100101 |
3 | 101211110021211101012010 |
4 | 1221201121021001211 |
5 | 3324021100131323 |
6 | 124014543144433 |
7 | 11120520500460 |
oct | 1514131110145 |
9 | 354407741163 |
10 | 113303130213 |
11 | 44062732799 |
12 | 19b60ba5119 |
13 | a8b8936c20 |
14 | 56abb762d7 |
15 | 2e320b7c93 |
hex | 1a61649065 |
113303130213 has 32 divisors (see below), whose sum is σ = 187671085056. Its totient is φ = 59205728448.
The previous prime is 113303130191. The next prime is 113303130251. The reversal of 113303130213 is 312031303311.
It is not a de Polignac number, because 113303130213 - 28 = 113303129957 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 113303130213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113303130313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1910181 + ... + 1968602.
It is an arithmetic number, because the mean of its divisors is an integer number (5864721408).
Almost surely, 2113303130213 is an apocalyptic number.
113303130213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113303130213 is a deficient number, since it is larger than the sum of its proper divisors (74367954843).
113303130213 is a wasteful number, since it uses less digits than its factorization.
113303130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3878913.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 113303130213 its reverse (312031303311), we get a palindrome (425334433524).
The spelling of 113303130213 in words is "one hundred thirteen billion, three hundred three million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •