Base | Representation |
---|---|
bin | 11110001111100110011010… |
… | …111001101101110101001110 |
3 | 122102221221221101220200001222 |
4 | 132033212122321231311032 |
5 | 114413243011344323042 |
6 | 1150521310425003342 |
7 | 40005622031523605 |
oct | 3617463271556516 |
9 | 572857841820058 |
10 | 133013441011022 |
11 | 39422757885480 |
12 | 12b02a90323552 |
13 | 592b162957140 |
14 | 24bbc5621ca3c |
15 | 1059eb8d042d2 |
hex | 78f99ae6dd4e |
133013441011022 has 64 divisors (see below), whose sum is σ = 234594195010560. Its totient is φ = 55763923670400.
The previous prime is 133013441011021. The next prime is 133013441011043. The reversal of 133013441011022 is 220110144310331.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 133013441010982 and 133013441011000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133013441011021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2708841323 + ... + 2708890425.
It is an arithmetic number, because the mean of its divisors is an integer number (3665534297040).
Almost surely, 2133013441011022 is an apocalyptic number.
133013441011022 is a deficient number, since it is larger than the sum of its proper divisors (101580753999538).
133013441011022 is a wasteful number, since it uses less digits than its factorization.
133013441011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56729.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 133013441011022 its reverse (220110144310331), we get a palindrome (353123585321353).
The spelling of 133013441011022 in words is "one hundred thirty-three trillion, thirteen billion, four hundred forty-one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •