Base | Representation |
---|---|
bin | 11110010001010100011001… |
… | …010000011010000011101110 |
3 | 122110101020201212210010011210 |
4 | 132101110121100122003232 |
5 | 114422211330400134200 |
6 | 1151051440034455250 |
7 | 40020302204105331 |
oct | 3621243120320356 |
9 | 573336655703153 |
10 | 133131525005550 |
11 | 394688431522a5 |
12 | 12b21946434526 |
13 | 5939330bc5756 |
14 | 24c3858cd2618 |
15 | 105d0ca989650 |
hex | 79151941a0ee |
133131525005550 has 96 divisors (see below), whose sum is σ = 335752386364800. Its totient is φ = 34903154943360.
The previous prime is 133131525005461. The next prime is 133131525005573. The reversal of 133131525005550 is 55500525131331.
It is a junction number, because it is equal to n+sod(n) for n = 133131525005499 and 133131525005508.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7897240 + ... + 18128139.
It is an arithmetic number, because the mean of its divisors is an integer number (3497420691300).
Almost surely, 2133131525005550 is an apocalyptic number.
133131525005550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133131525005550 is an abundant number, since it is smaller than the sum of its proper divisors (202620861359250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133131525005550 is a wasteful number, since it uses less digits than its factorization.
133131525005550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26025970 (or 26025965 counting only the distinct ones).
The product of its (nonzero) digits is 168750, while the sum is 39.
The spelling of 133131525005550 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, five hundred twenty-five million, five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •