Base | Representation |
---|---|
bin | 11110010000110111001000… |
… | …001111011011001000010101 |
3 | 122110021020121220000100220200 |
4 | 132100313020033123020111 |
5 | 114421203001330202404 |
6 | 1151025201533451113 |
7 | 40015110403464525 |
oct | 3620671017331025 |
9 | 573236556010820 |
10 | 133100101022229 |
11 | 39456488129550 |
12 | 12b17836640a99 |
13 | 5936393805693 |
14 | 24c21176d1685 |
15 | 105c38bd2e839 |
hex | 790dc83db215 |
133100101022229 has 24 divisors (see below), whose sum is σ = 213288297487200. Its totient is φ = 79299495212640.
The previous prime is 133100101022219. The next prime is 133100101022233. The reversal of 133100101022229 is 922220101001331.
133100101022229 is a `hidden beast` number, since 1 + 3 + 310 + 0 + 101 + 0 + 22 + 229 = 666.
It is not a de Polignac number, because 133100101022229 - 25 = 133100101022197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133100101022219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11393599794 + ... + 11393611475.
It is an arithmetic number, because the mean of its divisors is an integer number (8887012395300).
Almost surely, 2133100101022229 is an apocalyptic number.
It is an amenable number.
133100101022229 is a deficient number, since it is larger than the sum of its proper divisors (80188196464971).
133100101022229 is a wasteful number, since it uses less digits than its factorization.
133100101022229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22787211345 (or 22787211342 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The spelling of 133100101022229 in words is "one hundred thirty-three trillion, one hundred billion, one hundred one million, twenty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •