Base | Representation |
---|---|
bin | 111101100011111000… |
… | …1111100001000111010 |
3 | 110122020022002021002022 |
4 | 1323013301330020322 |
5 | 4131221344320000 |
6 | 140422053234442 |
7 | 12360026025434 |
oct | 1730761741072 |
9 | 418208067068 |
10 | 132200776250 |
11 | 5107a989984 |
12 | 21755932a22 |
13 | c60ab185ba |
14 | 65818a9654 |
15 | 368b185585 |
hex | 1ec7c7c23a |
132200776250 has 40 divisors (see below), whose sum is σ = 262373479236. Its totient is φ = 49769696000.
The previous prime is 132200776237. The next prime is 132200776259. The reversal of 132200776250 is 52677002231.
It can be written as a sum of positive squares in 10 ways, for example, as 5063603281 + 127137172969 = 71159^2 + 356563^2 .
It is a super-2 number, since 2×1322007762502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132200776250.
It is not an unprimeable number, because it can be changed into a prime (132200776259) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3089357 + ... + 3131856.
Almost surely, 2132200776250 is an apocalyptic number.
132200776250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132200776250 is a deficient number, since it is larger than the sum of its proper divisors (130172702986).
132200776250 is an equidigital number, since it uses as much as digits as its factorization.
132200776250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6221252 (or 6221237 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 35.
Adding to 132200776250 its reverse (52677002231), we get a palindrome (184877778481).
The spelling of 132200776250 in words is "one hundred thirty-two billion, two hundred million, seven hundred seventy-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •