Base | Representation |
---|---|
bin | 1111101111010… |
… | …00001101011011 |
3 | 100012102110200121 |
4 | 13313220031123 |
5 | 232244220011 |
6 | 21033414111 |
7 | 3162115042 |
oct | 767501533 |
9 | 305373617 |
10 | 132023131 |
11 | 68583a29 |
12 | 3826a337 |
13 | 214765c6 |
14 | 13769559 |
15 | b8cce71 |
hex | 7de835b |
132023131 has 4 divisors (see below), whose sum is σ = 132046200. Its totient is φ = 132000064.
The previous prime is 132023117. The next prime is 132023147. The reversal of 132023131 is 131320231.
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.
It is a cyclic number.
It is not a de Polignac number, because 132023131 - 221 = 129925979 is a prime.
It is a super-2 number, since 2×1320231312 = 34860214238086322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132023161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4260 + ... + 16798.
It is an arithmetic number, because the mean of its divisors is an integer number (33011550).
Almost surely, 2132023131 is an apocalyptic number.
132023131 is a deficient number, since it is larger than the sum of its proper divisors (23069).
132023131 is a wasteful number, since it uses less digits than its factorization.
132023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23068.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 132023131 is about 11490.1318965450. The cubic root of 132023131 is about 509.1940763407.
Adding to 132023131 its reverse (131320231), we get a palindrome (263343362).
The spelling of 132023131 in words is "one hundred thirty-two million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •