Base | Representation |
---|---|
bin | 11110000011110110000010… |
… | …011001110011010111100001 |
3 | 122100002201200220122002122112 |
4 | 132003312002121303113201 |
5 | 114312024004442442012 |
6 | 1145102223033045105 |
7 | 36563352264444314 |
oct | 3603660231632741 |
9 | 570081626562575 |
10 | 132205576140257 |
11 | 39141085158994 |
12 | 129b23abb56795 |
13 | 589cc1745a9a9 |
14 | 2490ad952697b |
15 | 1043e8530a122 |
hex | 783d826735e1 |
132205576140257 has 4 divisors (see below), whose sum is σ = 132465312046740. Its totient is φ = 131945840233776.
The previous prime is 132205576140181. The next prime is 132205576140293. The reversal of 132205576140257 is 752041675502231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 85156279296256 + 47049296844001 = 9228016^2 + 6859249^2 .
It is a cyclic number.
It is not a de Polignac number, because 132205576140257 - 230 = 132204502398433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132205576140457) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129867952478 + ... + 129867953495.
It is an arithmetic number, because the mean of its divisors is an integer number (33116328011685).
Almost surely, 2132205576140257 is an apocalyptic number.
It is an amenable number.
132205576140257 is a deficient number, since it is larger than the sum of its proper divisors (259735906483).
132205576140257 is an equidigital number, since it uses as much as digits as its factorization.
132205576140257 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259735906482.
The product of its (nonzero) digits is 3528000, while the sum is 50.
The spelling of 132205576140257 in words is "one hundred thirty-two trillion, two hundred five billion, five hundred seventy-six million, one hundred forty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •