Base | Representation |
---|---|
bin | 111101110011010001… |
… | …1110000010000001000 |
3 | 110200120021201211101221 |
4 | 1323212203300100020 |
5 | 4133301042314430 |
6 | 140545221051424 |
7 | 12405566113042 |
oct | 1734643602010 |
9 | 420507654357 |
10 | 132717151240 |
11 | 51315410073 |
12 | 2187a856b74 |
13 | c690ab4b2b |
14 | 65d02c4a92 |
15 | 36bb68557a |
hex | 1ee68f0408 |
132717151240 has 16 divisors (see below), whose sum is σ = 298613590380. Its totient is φ = 53086860480.
The previous prime is 132717151163. The next prime is 132717151271. The reversal of 132717151240 is 42151717231.
It can be written as a sum of positive squares in 2 ways, for example, as 129284831844 + 3432319396 = 359562^2 + 58586^2 .
It is a super-2 number, since 2×1327171512402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132717151196 and 132717151205.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1658964351 + ... + 1658964430.
Almost surely, 2132717151240 is an apocalyptic number.
132717151240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132717151240 is an abundant number, since it is smaller than the sum of its proper divisors (165896439140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132717151240 is a wasteful number, since it uses less digits than its factorization.
132717151240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3317928792 (or 3317928788 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 34.
Adding to 132717151240 its reverse (42151717231), we get a palindrome (174868868471).
The spelling of 132717151240 in words is "one hundred thirty-two billion, seven hundred seventeen million, one hundred fifty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •