Base | Representation |
---|---|
bin | 110100110001100101… |
… | …1111000111111111011 |
3 | 101211112101102122110012 |
4 | 1221203023320333323 |
5 | 3324101300224011 |
6 | 124021540012135 |
7 | 11121334254110 |
oct | 1514313707773 |
9 | 354471378405 |
10 | 113333211131 |
11 | 44078708a58 |
12 | 19b6b09104b |
13 | a8c1c3999a |
14 | 56b1b66907 |
15 | 2e34a5aa8b |
hex | 1a632f8ffb |
113333211131 has 8 divisors (see below), whose sum is σ = 136340705280. Its totient is φ = 92029975848.
The previous prime is 113333211119. The next prime is 113333211241. The reversal of 113333211131 is 131112333311.
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-113333211131 is a prime.
It is a super-2 number, since 2×1133332111312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113333211097 and 113333211106.
It is not an unprimeable number, because it can be changed into a prime (113333211631) 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, 426064571 + ... + 426064836.
It is an arithmetic number, because the mean of its divisors is an integer number (17042588160).
Almost surely, 2113333211131 is an apocalyptic number.
113333211131 is a deficient number, since it is larger than the sum of its proper divisors (23007494149).
113333211131 is an equidigital number, since it uses as much as digits as its factorization.
113333211131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852129433.
The product of its digits is 486, while the sum is 23.
Adding to 113333211131 its reverse (131112333311), we get a palindrome (244445544442).
The spelling of 113333211131 in words is "one hundred thirteen billion, three hundred thirty-three million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •