Base | Representation |
---|---|
bin | 11110001111101101101011… |
… | …111001000110101110101100 |
3 | 122102222201002002022222202021 |
4 | 132033231223321012232230 |
5 | 114413410001004200200 |
6 | 1150525040504435524 |
7 | 40006316250154126 |
oct | 3617555371065654 |
9 | 572881062288667 |
10 | 133021242256300 |
11 | 39425aa0440522 |
12 | 12b044a8a78ba4 |
13 | 592bb06c5a9c8 |
14 | 24bc39634a216 |
15 | 105a2c3b3e41a |
hex | 78fb6be46bac |
133021242256300 has 18 divisors (see below), whose sum is σ = 288656095696388. Its totient is φ = 53208496902480.
The previous prime is 133021242256241. The next prime is 133021242256303. The reversal of 133021242256300 is 3652242120331.
It is not an unprimeable number, because it can be changed into a prime (133021242256303) 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 5 ways as a sum of consecutive naturals, for example, 665106211182 + ... + 665106211381.
Almost surely, 2133021242256300 is an apocalyptic number.
133021242256300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133021242256300 is an abundant number, since it is smaller than the sum of its proper divisors (155634853440088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133021242256300 is a wasteful number, since it uses less digits than its factorization.
133021242256300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1330212422577 (or 1330212422570 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 133021242256300 its reverse (3652242120331), we get a palindrome (136673484376631).
The spelling of 133021242256300 in words is "one hundred thirty-three trillion, twenty-one billion, two hundred forty-two million, two hundred fifty-six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.339 sec. • engine limits •