Base | Representation |
---|---|
bin | 111101111111000101… |
… | …0101011001100100001 |
3 | 110201120220000201110211 |
4 | 1323332022223030201 |
5 | 4140103441330423 |
6 | 141052410254121 |
7 | 12421445533663 |
oct | 1737612531441 |
9 | 421526021424 |
10 | 133113230113 |
11 | 514a8a47a86 |
12 | 2196b427341 |
13 | c724b82726 |
14 | 662ab48533 |
15 | 36e132210d |
hex | 1efe2ab321 |
133113230113 has 8 divisors (see below), whose sum is σ = 133195266432. Its totient is φ = 133031226096.
The previous prime is 133113230099. The next prime is 133113230167. The reversal of 133113230113 is 311032311331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133113230113 is a prime.
It is a super-2 number, since 2×1331132301132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133113230713) 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, 16830906 + ... + 16838812.
It is an arithmetic number, because the mean of its divisors is an integer number (16649408304).
Almost surely, 2133113230113 is an apocalyptic number.
It is an amenable number.
133113230113 is a deficient number, since it is larger than the sum of its proper divisors (82036319).
133113230113 is an equidigital number, since it uses as much as digits as its factorization.
133113230113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16151.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 133113230113 its reverse (311032311331), we get a palindrome (444145541444).
The spelling of 133113230113 in words is "one hundred thirty-three billion, one hundred thirteen million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •