Base | Representation |
---|---|
bin | 111101111111010100… |
… | …1100000010100010100 |
3 | 110201121110020022202201 |
4 | 1323332221200110110 |
5 | 4140113023441040 |
6 | 141053255414244 |
7 | 12421604324254 |
oct | 1737651402424 |
9 | 421543208681 |
10 | 133121312020 |
11 | 51502568044 |
12 | 21972084384 |
13 | c726752218 |
14 | 662bc4d964 |
15 | 36e1dbba9a |
hex | 1efea60514 |
133121312020 has 48 divisors (see below), whose sum is σ = 283916279808. Its totient is φ = 52423511040.
The previous prime is 133121312011. The next prime is 133121312039. The reversal of 133121312020 is 20213121331.
133121312020 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 190909 + ... + 550171.
It is an arithmetic number, because the mean of its divisors is an integer number (5914922496).
Almost surely, 2133121312020 is an apocalyptic number.
133121312020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133121312020 is an abundant number, since it is smaller than the sum of its proper divisors (150794967788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133121312020 is a wasteful number, since it uses less digits than its factorization.
133121312020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359560 (or 359558 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133121312020 its reverse (20213121331), we get a palindrome (153334433351).
The spelling of 133121312020 in words is "one hundred thirty-three billion, one hundred twenty-one million, three hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •