Base | Representation |
---|---|
bin | 11110000100100100000110… |
… | …111101000011010010000010 |
3 | 122100021110101110021220021221 |
4 | 132010210012331003102002 |
5 | 114313331312410111000 |
6 | 1145141043450105254 |
7 | 36600053203514536 |
oct | 3604440675032202 |
9 | 570243343256257 |
10 | 132255044613250 |
11 | 3916005a890919 |
12 | 129bbab6a1b22a |
13 | 58a479c0575a0 |
14 | 249326d415bc6 |
15 | 10453cd1aa61a |
hex | 784906f43482 |
132255044613250 has 256 divisors, whose sum is σ = 290223041472000. Its totient is φ = 44712085017600.
The previous prime is 132255044613199. The next prime is 132255044613311. The reversal of 132255044613250 is 52316440552231.
It is a junction number, because it is equal to n+sod(n) for n = 132255044613197 and 132255044613206.
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 127 ways as a sum of consecutive naturals, for example, 218972676 + ... + 219575824.
It is an arithmetic number, because the mean of its divisors is an integer number (1133683755750).
Almost surely, 2132255044613250 is an apocalyptic number.
132255044613250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132255044613250 is an abundant number, since it is smaller than the sum of its proper divisors (157967996858750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132255044613250 is a wasteful number, since it uses less digits than its factorization.
132255044613250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603318 (or 603308 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 43.
The spelling of 132255044613250 in words is "one hundred thirty-two trillion, two hundred fifty-five billion, forty-four million, six hundred thirteen thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •