Base | Representation |
---|---|
bin | 11110010010010100001100… |
… | …100010100010001001101100 |
3 | 122110121210120012010211100110 |
4 | 132102110030202202021230 |
5 | 114424322130432131340 |
6 | 1151143125522500020 |
7 | 40025245641416325 |
oct | 3622241442421154 |
9 | 573553505124313 |
10 | 133200031130220 |
11 | 394948a806775a |
12 | 12b33084b04610 |
13 | 594292a9b37b2 |
14 | 24c6cb735b44c |
15 | 105ec89d60680 |
hex | 79250c8a226c |
133200031130220 has 48 divisors (see below), whose sum is σ = 372966836014080. Its totient is φ = 35519365553856.
The previous prime is 133200031130191. The next prime is 133200031130261. The reversal of 133200031130220 is 22031130002331.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16737852 + ... + 23378531.
It is an arithmetic number, because the mean of its divisors is an integer number (7770142416960).
Almost surely, 2133200031130220 is an apocalyptic number.
133200031130220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133200031130220 is an abundant number, since it is smaller than the sum of its proper divisors (239766804883860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133200031130220 is a wasteful number, since it uses less digits than its factorization.
133200031130220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40171734 (or 40171732 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 133200031130220 its reverse (22031130002331), we get a palindrome (155231161132551).
The spelling of 133200031130220 in words is "one hundred thirty-three trillion, two hundred billion, thirty-one million, one hundred thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •