Base | Representation |
---|---|
bin | 110100101110100001… |
… | …1010100001111000111 |
3 | 101211021012210020001122 |
4 | 1221131003110033013 |
5 | 3323343424100403 |
6 | 124003422144155 |
7 | 11115644446004 |
oct | 1513503241707 |
9 | 354235706048 |
10 | 113230300103 |
11 | 44025609418 |
12 | 19b4072205b |
13 | a8a681719b |
14 | 56a22188ab |
15 | 2e2a9cd838 |
hex | 1a5d0d43c7 |
113230300103 has 8 divisors (see below), whose sum is σ = 117196858800. Its totient is φ = 109267879168.
The previous prime is 113230300081. The next prime is 113230300187. The reversal of 113230300103 is 301003032311.
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 113230300103 - 210 = 113230299079 is a prime.
It is a super-2 number, since 2×1132303001032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113230300193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 978701 + ... + 1088262.
It is an arithmetic number, because the mean of its divisors is an integer number (14649607350).
Almost surely, 2113230300103 is an apocalyptic number.
113230300103 is a deficient number, since it is larger than the sum of its proper divisors (3966558697).
113230300103 is a wasteful number, since it uses less digits than its factorization.
113230300103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2068881.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 113230300103 its reverse (301003032311), we get a palindrome (414233332414).
The spelling of 113230300103 in words is "one hundred thirteen billion, two hundred thirty million, three hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •