Base | Representation |
---|---|
bin | 110100100111101100… |
… | …1000111010001001011 |
3 | 101210200020120100002000 |
4 | 1221033121013101023 |
5 | 3322411242230011 |
6 | 123524554242043 |
7 | 11110162532505 |
oct | 1511731072113 |
9 | 353606510060 |
10 | 113001133131 |
11 | 43a18214927 |
12 | 19a97a26323 |
13 | a86b1ba123 |
14 | 567da02d75 |
15 | 2e15812356 |
hex | 1a4f64744b |
113001133131 has 8 divisors (see below), whose sum is σ = 167409086160. Its totient is φ = 75334088736.
The previous prime is 113001133129. The next prime is 113001133139. The reversal of 113001133131 is 131331100311.
113001133131 is a `hidden beast` number, since 1 + 1 + 300 + 1 + 1 + 331 + 31 = 666.
It is not a de Polignac number, because 113001133131 - 21 = 113001133129 is a prime.
It is a super-2 number, since 2×1130011331312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113001133139) 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, 2092613550 + ... + 2092613603.
It is an arithmetic number, because the mean of its divisors is an integer number (20926135770).
Almost surely, 2113001133131 is an apocalyptic number.
113001133131 is a deficient number, since it is larger than the sum of its proper divisors (54407953029).
113001133131 is an equidigital number, since it uses as much as digits as its factorization.
113001133131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4185227162 (or 4185227156 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 113001133131 its reverse (131331100311), we get a palindrome (244332233442).
The spelling of 113001133131 in words is "one hundred thirteen billion, one million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •