Base | Representation |
---|---|
bin | 11110010001001100011101… |
… | …110010000110011000011000 |
3 | 122110100102202112012102211210 |
4 | 132101030131302012120120 |
5 | 114422041411304341440 |
6 | 1151043511134223120 |
7 | 40016551212260133 |
oct | 3621143562063030 |
9 | 573312675172753 |
10 | 133123011012120 |
11 | 3946517422aa98 |
12 | 12b2016b054aa0 |
13 | 59385a503b10c |
14 | 24c328c26d21a |
15 | 105cc7d2aea80 |
hex | 79131dc86618 |
133123011012120 has 64 divisors (see below), whose sum is σ = 400653177949440. Its totient is φ = 35385323388800.
The previous prime is 133123011012119. The next prime is 133123011012127. The reversal of 133123011012120 is 21210110321331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133123011012127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1783497126 + ... + 1783571765.
It is an arithmetic number, because the mean of its divisors is an integer number (6260205905460).
Almost surely, 2133123011012120 is an apocalyptic number.
133123011012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133123011012120 is an abundant number, since it is smaller than the sum of its proper divisors (267530166937320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133123011012120 is a wasteful number, since it uses less digits than its factorization.
133123011012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3567069216 (or 3567069212 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 133123011012120 its reverse (21210110321331), we get a palindrome (154333121333451).
The spelling of 133123011012120 in words is "one hundred thirty-three trillion, one hundred twenty-three billion, eleven million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •