Base | Representation |
---|---|
bin | 1111110111100… |
… | …01110101011011 |
3 | 100021110202010220 |
4 | 13323301311123 |
5 | 233034024011 |
6 | 21113011123 |
7 | 3204266046 |
oct | 773616533 |
9 | 307422126 |
10 | 133111131 |
11 | 691573aa |
12 | 386b3aa3 |
13 | 217678aa |
14 | 1396dc5d |
15 | ba45506 |
hex | 7ef1d5b |
133111131 has 16 divisors (see below), whose sum is σ = 193267200. Its totient is φ = 81170208.
The previous prime is 133111109. The next prime is 133111151. The reversal of 133111131 is 131111331.
It is not a de Polignac number, because 133111131 - 26 = 133111067 is a prime.
It is a super-2 number, since 2×1331111312 = 35437146392198322, which contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 133111131.
It is not an unprimeable number, because it can be changed into a prime (133111151) 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 15 ways as a sum of consecutive naturals, for example, 38611 + ... + 41916.
It is an arithmetic number, because the mean of its divisors is an integer number (12079200).
Almost surely, 2133111131 is an apocalyptic number.
133111131 is a deficient number, since it is larger than the sum of its proper divisors (60156069).
133111131 is a wasteful number, since it uses less digits than its factorization.
133111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80578.
The product of its digits is 27, while the sum is 15.
The square root of 133111131 is about 11537.3797285172. The cubic root of 133111131 is about 510.5890042277.
Adding to 133111131 its reverse (131111331), we get a palindrome (264222462).
The spelling of 133111131 in words is "one hundred thirty-three million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •