Base | Representation |
---|---|
bin | 11110010001010011000101… |
… | …101000011110111110101111 |
3 | 122110101010010002211121221021 |
4 | 132101103011220132332233 |
5 | 114422200442214443043 |
6 | 1151051044520115011 |
7 | 40020222350033515 |
oct | 3621230550367657 |
9 | 573333102747837 |
10 | 133130122031023 |
11 | 39468193211817 |
12 | 12b21614605a67 |
13 | 5939169345100 |
14 | 24c37648484b5 |
15 | 105d0477083ed |
hex | 7914c5a1efaf |
133130122031023 has 12 divisors (see below), whose sum is σ = 144955109529048. Its totient is φ = 122210396736480.
The previous prime is 133130122031021. The next prime is 133130122031057. The reversal of 133130122031023 is 320130221031331.
It is not a de Polignac number, because 133130122031023 - 21 = 133130122031021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133130122031021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2176080465 + ... + 2176141642.
It is an arithmetic number, because the mean of its divisors is an integer number (12079592460754).
Almost surely, 2133130122031023 is an apocalyptic number.
133130122031023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133130122031023 is a deficient number, since it is larger than the sum of its proper divisors (11824987498025).
133130122031023 is a wasteful number, since it uses less digits than its factorization.
133130122031023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4352222314 (or 4352222301 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133130122031023 its reverse (320130221031331), we get a palindrome (453260343062354).
The spelling of 133130122031023 in words is "one hundred thirty-three trillion, one hundred thirty billion, one hundred twenty-two million, thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •