Base | Representation |
---|---|
bin | 111110001001111100… |
… | …1000001011000010010 |
3 | 110202112021211202201200 |
4 | 1330103321001120102 |
5 | 4141330242414023 |
6 | 141152510212030 |
7 | 12433462511505 |
oct | 1742371013022 |
9 | 422467752650 |
10 | 133477701138 |
11 | 51675756501 |
12 | 21a514b4016 |
13 | c782534562 |
14 | 666330113c |
15 | 3713318743 |
hex | 1f13e41612 |
133477701138 has 24 divisors (see below), whose sum is σ = 290475710928. Its totient is φ = 44296563192.
The previous prime is 133477701113. The next prime is 133477701191. The reversal of 133477701138 is 831107774331.
133477701138 is a `hidden beast` number, since 133 + 477 + 7 + 0 + 11 + 38 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 133477701093 and 133477701102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16329456 + ... + 16337627.
It is an arithmetic number, because the mean of its divisors is an integer number (12103154622).
Almost surely, 2133477701138 is an apocalyptic number.
133477701138 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
133477701138 is an abundant number, since it is smaller than the sum of its proper divisors (156998009790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133477701138 is a wasteful number, since it uses less digits than its factorization.
133477701138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32667318 (or 32667315 counting only the distinct ones).
The product of its (nonzero) digits is 296352, while the sum is 45.
The spelling of 133477701138 in words is "one hundred thirty-three billion, four hundred seventy-seven million, seven hundred one thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •