Base | Representation |
---|---|
bin | 110100110001100110… |
… | …0001111011110101101 |
3 | 101211112101121022202122 |
4 | 1221203030033132231 |
5 | 3324101311200323 |
6 | 124021542002325 |
7 | 11121335116424 |
oct | 1514314173655 |
9 | 354471538678 |
10 | 113333303213 |
11 | 44078771159 |
12 | 19b6b1163a5 |
13 | a8c1c6c880 |
14 | 56b1b8c2bb |
15 | 2e34a77ec8 |
hex | 1a6330f7ad |
113333303213 has 32 divisors (see below), whose sum is σ = 128484128640. Its totient is φ = 99273081600.
The previous prime is 113333303207. The next prime is 113333303233. The reversal of 113333303213 is 312303333311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 113333303213 - 224 = 113316525997 is a prime.
It is a super-2 number, since 2×1133333032132 (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 (113333303233) 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, 3237518 + ... + 3272336.
It is an arithmetic number, because the mean of its divisors is an integer number (4015129020).
Almost surely, 2113333303213 is an apocalyptic number.
113333303213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113333303213 is a deficient number, since it is larger than the sum of its proper divisors (15150825427).
113333303213 is a wasteful number, since it uses less digits than its factorization.
113333303213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35037.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 113333303213 its reverse (312303333311), we get a palindrome (425636636524).
The spelling of 113333303213 in words is "one hundred thirteen billion, three hundred thirty-three million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •