Base | Representation |
---|---|
bin | 111101110011110110… |
… | …0110110010010111010 |
3 | 110200121121210022201110 |
4 | 1323213230312102322 |
5 | 4133320444000011 |
6 | 140551143501150 |
7 | 12406221016560 |
oct | 1734754662272 |
9 | 420547708643 |
10 | 132736312506 |
11 | 51325208226 |
12 | 218851577b6 |
13 | c694a63565 |
14 | 65d2a71a30 |
15 | 36bd1bcba6 |
hex | 1ee7b364ba |
132736312506 has 128 divisors (see below), whose sum is σ = 319145287680. Its totient is φ = 35983842048.
The previous prime is 132736312469. The next prime is 132736312507. The reversal of 132736312506 is 605213637231.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132736312507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 124168140 + ... + 124169208.
It is an arithmetic number, because the mean of its divisors is an integer number (2493322560).
Almost surely, 2132736312506 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132736312506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159572643840).
132736312506 is an abundant number, since it is smaller than the sum of its proper divisors (186408975174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132736312506 is a wasteful number, since it uses less digits than its factorization.
132736312506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020.
The product of its (nonzero) digits is 136080, while the sum is 39.
Adding to 132736312506 its reverse (605213637231), we get a palindrome (737949949737).
The spelling of 132736312506 in words is "one hundred thirty-two billion, seven hundred thirty-six million, three hundred twelve thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •