Base | Representation |
---|---|
bin | 11110010000110111111111… |
… | …101000000010100100101011 |
3 | 122110021100000122110121112120 |
4 | 132100313333220002210223 |
5 | 114421211402214101443 |
6 | 1151025434045442323 |
7 | 40015142415530235 |
oct | 3620677750024453 |
9 | 573240018417476 |
10 | 133101030222123 |
11 | 39456914695147 |
12 | 12b17a558703a3 |
13 | 59364b1183ac2 |
14 | 24c21a4c8d255 |
15 | 105c3e36c8083 |
hex | 790dffa0292b |
133101030222123 has 32 divisors (see below), whose sum is σ = 181373641689600. Its totient is φ = 86804581053696.
The previous prime is 133101030222091. The next prime is 133101030222169. The reversal of 133101030222123 is 321222030101331.
It is not a de Polignac number, because 133101030222123 - 25 = 133101030222091 is a prime.
It is a super-3 number, since 3×1331010302221233 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133101030222093 and 133101030222102.
It is not an unprimeable number, because it can be changed into a prime (133101035222123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19070298 + ... + 25097376.
It is an arithmetic number, because the mean of its divisors is an integer number (5667926302800).
Almost surely, 2133101030222123 is an apocalyptic number.
133101030222123 is a deficient number, since it is larger than the sum of its proper divisors (48272611467477).
133101030222123 is a wasteful number, since it uses less digits than its factorization.
133101030222123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6028051.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 133101030222123 its reverse (321222030101331), we get a palindrome (454323060323454).
The spelling of 133101030222123 in words is "one hundred thirty-three trillion, one hundred one billion, thirty million, two hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •