Base | Representation |
---|---|
bin | 11110010000111000111010… |
… | …000110100110100001010010 |
3 | 122110021102120000120011010110 |
4 | 132100320322012212201102 |
5 | 114421220404343442320 |
6 | 1151030115253542150 |
7 | 40015205630622213 |
oct | 3620707206464122 |
9 | 573242500504113 |
10 | 133102011312210 |
11 | 394572784726a6 |
12 | 12b1808a344956 |
13 | 59366094cca95 |
14 | 24c22592b740a |
15 | 105c44e8c15e0 |
hex | 790e3a1a6852 |
133102011312210 has 64 divisors (see below), whose sum is σ = 327908108715264. Its totient is φ = 34557060326400.
The previous prime is 133102011312191. The next prime is 133102011312217. The reversal of 133102011312210 is 12213110201331.
It is a super-2 number, since 2×1331020113122102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133102011312217) 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, 110502651 + ... + 111700670.
It is an arithmetic number, because the mean of its divisors is an integer number (5123564198676).
Almost surely, 2133102011312210 is an apocalyptic number.
133102011312210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133102011312210 is an abundant number, since it is smaller than the sum of its proper divisors (194806097403054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133102011312210 is a wasteful number, since it uses less digits than its factorization.
133102011312210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222203859.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 133102011312210 its reverse (12213110201331), we get a palindrome (145315121513541).
The spelling of 133102011312210 in words is "one hundred thirty-three trillion, one hundred two billion, eleven million, three hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •