Base | Representation |
---|---|
bin | 11110001111011111110010… |
… | …100101111111010101111000 |
3 | 122102221021120021210200202120 |
4 | 132033133302211333111320 |
5 | 114413133422002102110 |
6 | 1150514132210201240 |
7 | 40005250441503102 |
oct | 3617376245772570 |
9 | 572837507720676 |
10 | 133006322300280 |
11 | 3941a73451a760 |
12 | 12b01624283220 |
13 | 592a599b89070 |
14 | 24bb77ca00572 |
15 | 1059bedd8b870 |
hex | 78f7f297f578 |
133006322300280 has 128 divisors (see below), whose sum is σ = 468777527608320. Its totient is φ = 29763652538880.
The previous prime is 133006322300273. The next prime is 133006322300321. The reversal of 133006322300280 is 82003223600331.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3875458432 + ... + 3875492751.
It is an arithmetic number, because the mean of its divisors is an integer number (3662324434440).
Almost surely, 2133006322300280 is an apocalyptic number.
133006322300280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133006322300280 is an abundant number, since it is smaller than the sum of its proper divisors (335771205308040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133006322300280 is a wasteful number, since it uses less digits than its factorization.
133006322300280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7750951221 (or 7750951217 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 33.
The spelling of 133006322300280 in words is "one hundred thirty-three trillion, six billion, three hundred twenty-two million, three hundred thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •