Base | Representation |
---|---|
bin | 111101111011101111… |
… | …1110001011110001011 |
3 | 110201022002110010010002 |
4 | 1323313133301132023 |
5 | 4134341314222311 |
6 | 141033331513215 |
7 | 12415616366255 |
oct | 1736737613613 |
9 | 421262403102 |
10 | 133001320331 |
11 | 51450861560 |
12 | 21939a5880b |
13 | c70792c019 |
14 | 6619d36cd5 |
15 | 36d65b893b |
hex | 1ef77f178b |
133001320331 has 8 divisors (see below), whose sum is σ = 145103761200. Its totient is φ = 120900781440.
The previous prime is 133001320313. The next prime is 133001320337. The reversal of 133001320331 is 133023100331.
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 133001320331 - 218 = 133001058187 is a prime.
It is a super-2 number, since 2×1330013203312 (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 (133001320337) 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, 327266 + ... + 610823.
It is an arithmetic number, because the mean of its divisors is an integer number (18137970150).
Almost surely, 2133001320331 is an apocalyptic number.
133001320331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133001320331 is a deficient number, since it is larger than the sum of its proper divisors (12102440869).
133001320331 is a wasteful number, since it uses less digits than its factorization.
133001320331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 950989.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 133001320331 its reverse (133023100331), we get a palindrome (266024420662).
The spelling of 133001320331 in words is "one hundred thirty-three billion, one million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.933 sec. • engine limits •