Base | Representation |
---|---|
bin | 11110001111101101011110… |
… | …000111000011000001011110 |
3 | 122102222200110222020111001022 |
4 | 132033231132013003001132 |
5 | 114413404012310430420 |
6 | 1150525001524444142 |
7 | 40006310441603240 |
oct | 3617553607030136 |
9 | 572880428214038 |
10 | 133021011030110 |
11 | 3942599196a8a5 |
12 | 12b04443549652 |
13 | 592ba9b08c588 |
14 | 24bc37375a090 |
15 | 105a2ad6b7c25 |
hex | 78fb5e1c305e |
133021011030110 has 256 divisors, whose sum is σ = 306890366976000. Its totient is φ = 40490812707840.
The previous prime is 133021011030071. The next prime is 133021011030113. The reversal of 133021011030110 is 11030110120331.
It is a super-2 number, since 2×1330210110301102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133021011030113) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 162574106 + ... + 163390274.
It is an arithmetic number, because the mean of its divisors is an integer number (1198790496000).
Almost surely, 2133021011030110 is an apocalyptic number.
133021011030110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133021011030110 is an abundant number, since it is smaller than the sum of its proper divisors (173869355945890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133021011030110 is a wasteful number, since it uses less digits than its factorization.
133021011030110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 816359.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133021011030110 its reverse (11030110120331), we get a palindrome (144051121150441).
The spelling of 133021011030110 in words is "one hundred thirty-three trillion, twenty-one billion, eleven million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •