Base | Representation |
---|---|
bin | 11110010001001101100100… |
… | …101011101101111000001110 |
3 | 122110100112211102110202120202 |
4 | 132101031210223231320032 |
5 | 114422101330313134410 |
6 | 1151044225145413502 |
7 | 40016622535032542 |
oct | 3621154453557016 |
9 | 573315742422522 |
10 | 133124200521230 |
11 | 39465724720876 |
12 | 12b2044149a292 |
13 | 59387345cb469 |
14 | 24c336222ba22 |
15 | 105ccec926ca5 |
hex | 791364aede0e |
133124200521230 has 16 divisors (see below), whose sum is σ = 245468038035024. Its totient is φ = 51950907520320.
The previous prime is 133124200521229. The next prime is 133124200521233. The reversal of 133124200521230 is 32125002421331.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 133124200521193 and 133124200521202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133124200521233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162346585592 + ... + 162346586411.
It is an arithmetic number, because the mean of its divisors is an integer number (15341752377189).
Almost surely, 2133124200521230 is an apocalyptic number.
133124200521230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133124200521230 is a deficient number, since it is larger than the sum of its proper divisors (112343837513794).
133124200521230 is a wasteful number, since it uses less digits than its factorization.
133124200521230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324693172051.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 133124200521230 its reverse (32125002421331), we get a palindrome (165249202942561).
The spelling of 133124200521230 in words is "one hundred thirty-three trillion, one hundred twenty-four billion, two hundred million, five hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •