Base | Representation |
---|---|
bin | 111101111100101001… |
… | …0111111000001111111 |
3 | 110201101012021112121101 |
4 | 1323321102333001333 |
5 | 4134422032204211 |
6 | 141040331113531 |
7 | 12416434166113 |
oct | 1737122770177 |
9 | 421335245541 |
10 | 133031522431 |
11 | 5146690a875 |
12 | 21947ba28a7 |
13 | c710c74ca2 |
14 | 661dd59743 |
15 | 36d90825c1 |
hex | 1ef94bf07f |
133031522431 has 8 divisors (see below), whose sum is σ = 133561328544. Its totient is φ = 132501811200.
The previous prime is 133031522417. The next prime is 133031522483. The reversal of 133031522431 is 134225130331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133031522431 - 29 = 133031521919 is a prime.
It is a super-2 number, since 2×1330315224312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133031522431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133031222431) 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, 4444291 + ... + 4474123.
It is an arithmetic number, because the mean of its divisors is an integer number (16695166068).
Almost surely, 2133031522431 is an apocalyptic number.
133031522431 is a deficient number, since it is larger than the sum of its proper divisors (529806113).
133031522431 is a wasteful number, since it uses less digits than its factorization.
133031522431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47441.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 133031522431 its reverse (134225130331), we get a palindrome (267256652762).
The spelling of 133031522431 in words is "one hundred thirty-three billion, thirty-one million, five hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •