Base | Representation |
---|---|
bin | 11110010001000010011100… |
… | …000100101010100101001101 |
3 | 122110022101222012212121010102 |
4 | 132101002130010222211031 |
5 | 114421402334144000232 |
6 | 1151034530543220445 |
7 | 40016020343006435 |
oct | 3621023404524515 |
9 | 573271865777112 |
10 | 133112244906317 |
11 | 3946064a025396 |
12 | 12b1a0655a7725 |
13 | 593757a707401 |
14 | 24c294a4852c5 |
15 | 105c84d022662 |
hex | 79109c12a94d |
133112244906317 has 2 divisors, whose sum is σ = 133112244906318. Its totient is φ = 133112244906316.
The previous prime is 133112244906301. The next prime is 133112244906323. The reversal of 133112244906317 is 713609442211331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120799311283876 + 12312933622441 = 10990874^2 + 3508979^2 .
It is a cyclic number.
It is not a de Polignac number, because 133112244906317 - 24 = 133112244906301 is a prime.
It is a super-2 number, since 2×1331122449063172 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133112244906367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66556122453158 + 66556122453159.
It is an arithmetic number, because the mean of its divisors is an integer number (66556122453159).
Almost surely, 2133112244906317 is an apocalyptic number.
It is an amenable number.
133112244906317 is a deficient number, since it is larger than the sum of its proper divisors (1).
133112244906317 is an equidigital number, since it uses as much as digits as its factorization.
133112244906317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 653184, while the sum is 47.
The spelling of 133112244906317 in words is "one hundred thirty-three trillion, one hundred twelve billion, two hundred forty-four million, nine hundred six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •