Base | Representation |
---|---|
bin | 1111110000000… |
… | …10011000010011 |
3 | 100012121220201200 |
4 | 13320002120103 |
5 | 232311132243 |
6 | 21040002243 |
7 | 3163042413 |
oct | 770023023 |
9 | 305556650 |
10 | 132130323 |
11 | 68647516 |
12 | 38300383 |
13 | 214b3330 |
14 | 13796643 |
15 | b8eead3 |
hex | 7e02613 |
132130323 has 24 divisors (see below), whose sum is σ = 209030640. Its totient is φ = 79928640.
The previous prime is 132130319. The next prime is 132130333. The reversal of 132130323 is 323031231.
132130323 is nontrivially palindromic in base 12.
It is not a de Polignac number, because 132130323 - 22 = 132130319 is a prime.
It is a super-3 number, since 3×1321303233 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132130296 and 132130305.
It is not an unprimeable number, because it can be changed into a prime (132130333) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2668 + ... + 16473.
It is an arithmetic number, because the mean of its divisors is an integer number (8709610).
Almost surely, 2132130323 is an apocalyptic number.
132130323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132130323 is a deficient number, since it is larger than the sum of its proper divisors (76900317).
132130323 is a wasteful number, since it uses less digits than its factorization.
132130323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19219 (or 19216 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
The square root of 132130323 is about 11494.7954744745. The cubic root of 132130323 is about 509.3318470626.
Adding to 132130323 its reverse (323031231), we get a palindrome (455161554).
The spelling of 132130323 in words is "one hundred thirty-two million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •