Base | Representation |
---|---|
bin | 1111110011000… |
… | …11111101100111 |
3 | 100020101020000101 |
4 | 13321203331213 |
5 | 232411430043 |
6 | 21052324531 |
7 | 3166325623 |
oct | 771437547 |
9 | 306336011 |
10 | 132530023 |
11 | 6889a84a |
12 | 38473747 |
13 | 215c3242 |
14 | 1385c183 |
15 | b97d24d |
hex | 7e63f67 |
132530023 has 4 divisors (see below), whose sum is σ = 132553120. Its totient is φ = 132506928.
The previous prime is 132529981. The next prime is 132530039. The reversal of 132530023 is 320035231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 320035231 = 1847 ⋅173273.
It is a cyclic number.
It is not a de Polignac number, because 132530023 - 217 = 132398951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132530063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4411 + ... + 16867.
It is an arithmetic number, because the mean of its divisors is an integer number (33138280).
Almost surely, 2132530023 is an apocalyptic number.
132530023 is a deficient number, since it is larger than the sum of its proper divisors (23097).
132530023 is a wasteful number, since it uses less digits than its factorization.
132530023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23096.
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 132530023 is about 11512.1684751397. The cubic root of 132530023 is about 509.8449137570.
Adding to 132530023 its reverse (320035231), we get a palindrome (452565254).
The spelling of 132530023 in words is "one hundred thirty-two million, five hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •