Base | Representation |
---|---|
bin | 111101011110111101… |
… | …0110001111010110101 |
3 | 110121210202202021212112 |
4 | 1322331322301322311 |
5 | 4130402020242100 |
6 | 140353423100405 |
7 | 12352646500232 |
oct | 1727572617265 |
9 | 417722667775 |
10 | 132035321525 |
11 | 50aa5551338 |
12 | 2170a441705 |
13 | c5b27680b3 |
14 | 656791a789 |
15 | 367b8a1b35 |
hex | 1ebdeb1eb5 |
132035321525 has 12 divisors (see below), whose sum is σ = 165225855300. Its totient is φ = 104659188480.
The previous prime is 132035321501. The next prime is 132035321533. The reversal of 132035321525 is 525123530231.
It can be written as a sum of positive squares in 6 ways, for example, as 79673476 + 131955648049 = 8926^2 + 363257^2 .
It is not a de Polignac number, because 132035321525 - 212 = 132035317429 is a prime.
It is a super-2 number, since 2×1320353215252 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132035321491 and 132035321500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24223940 + ... + 24229389.
It is an arithmetic number, because the mean of its divisors is an integer number (13768821275).
Almost surely, 2132035321525 is an apocalyptic number.
It is an amenable number.
132035321525 is a deficient number, since it is larger than the sum of its proper divisors (33190533775).
132035321525 is a wasteful number, since it uses less digits than its factorization.
132035321525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48453448 (or 48453443 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 132035321525 its reverse (525123530231), we get a palindrome (657158851756).
The spelling of 132035321525 in words is "one hundred thirty-two billion, thirty-five million, three hundred twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •