Base | Representation |
---|---|
bin | 11110010000111000100000… |
… | …101100101111001000010011 |
3 | 122110021101110022120101201100 |
4 | 132100320200230233020103 |
5 | 114421214021241220311 |
6 | 1151030005110435443 |
7 | 40015162234113000 |
oct | 3620704054571023 |
9 | 573241408511640 |
10 | 133101585101331 |
11 | 39457079925100 |
12 | 12b17b8b662b83 |
13 | 593656c1120b2 |
14 | 24c221884c8a7 |
15 | 105c427281a56 |
hex | 790e20b2f213 |
133101585101331 has 144 divisors (see below), whose sum is σ = 246674120056000. Its totient is φ = 69078792625920.
The previous prime is 133101585101279. The next prime is 133101585101341.
133101585101331 is a `hidden beast` number, since 1 + 3 + 3 + 1 + 0 + 1 + 5 + 8 + 510 + 133 + 1 = 666.
133101585101331 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 133101585101331 - 210 = 133101585100307 is a prime.
It is a super-2 number, since 2×1331015851013312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133101585101341) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 399133695 + ... + 399467031.
Almost surely, 2133101585101331 is an apocalyptic number.
133101585101331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133101585101331 is a deficient number, since it is larger than the sum of its proper divisors (113572534954669).
133101585101331 is a wasteful number, since it uses less digits than its factorization.
133101585101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334455 (or 334427 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 36.
The spelling of 133101585101331 in words is "one hundred thirty-three trillion, one hundred one billion, five hundred eighty-five million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •