Base | Representation |
---|---|
bin | 11110001111100101001011… |
… | …101000001101100000110101 |
3 | 122102221211111201022020022020 |
4 | 132033211023220031200311 |
5 | 114413232300410202013 |
6 | 1150520530434423353 |
7 | 40005544052022150 |
oct | 3617451350154065 |
9 | 572854451266266 |
10 | 133012111022133 |
11 | 39422135065102 |
12 | 12b0277aa31b59 |
13 | 592acb024c275 |
14 | 24bbb6b732c97 |
15 | 1059e3c18d623 |
hex | 78f94ba0d835 |
133012111022133 has 16 divisors (see below), whose sum is σ = 202685494394880. Its totient is φ = 76006780770096.
The previous prime is 133012111022111. The next prime is 133012111022171. The reversal of 133012111022133 is 331220111210331.
133012111022133 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 133012111022133 - 25 = 133012111022101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133012111022633) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6465516 + ... + 17545002.
It is an arithmetic number, because the mean of its divisors is an integer number (12667843399680).
Almost surely, 2133012111022133 is an apocalyptic number.
It is an amenable number.
133012111022133 is a deficient number, since it is larger than the sum of its proper divisors (69673383372747).
133012111022133 is a wasteful number, since it uses less digits than its factorization.
133012111022133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11651176.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 133012111022133 its reverse (331220111210331), we get a palindrome (464232222232464).
The spelling of 133012111022133 in words is "one hundred thirty-three trillion, twelve billion, one hundred eleven million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •