Base | Representation |
---|---|
bin | 111101011111011100… |
… | …0100001000101111011 |
3 | 110121211220012112011011 |
4 | 1322332320201011323 |
5 | 4130420141134111 |
6 | 140355202014351 |
7 | 12353234164021 |
oct | 1727670410573 |
9 | 417756175134 |
10 | 132051505531 |
11 | 510036a5650 |
12 | 217139473b7 |
13 | c5b5c1362a |
14 | 6569b30711 |
15 | 367ceec021 |
hex | 1ebee2117b |
132051505531 has 16 divisors (see below), whose sum is σ = 146233375488. Its totient is φ = 118233165600.
The previous prime is 132051505493. The next prime is 132051505577. The reversal of 132051505531 is 135505150231.
It is not a de Polignac number, because 132051505531 - 225 = 132017951099 is a prime.
It is a super-2 number, since 2×1320515055312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132051505493 and 132051505502.
It is not an unprimeable number, because it can be changed into a prime (132051500531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4984386 + ... + 5010808.
It is an arithmetic number, because the mean of its divisors is an integer number (9139585968).
Almost surely, 2132051505531 is an apocalyptic number.
132051505531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132051505531 is a deficient number, since it is larger than the sum of its proper divisors (14181869957).
132051505531 is a wasteful number, since it uses less digits than its factorization.
132051505531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33282.
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 132051505531 its reverse (135505150231), we get a palindrome (267556655762).
The spelling of 132051505531 in words is "one hundred thirty-two billion, fifty-one million, five hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •