Base | Representation |
---|---|
bin | 111101011101111010… |
… | …0000010100011100111 |
3 | 110121201022021210011110 |
4 | 1322323310002203213 |
5 | 4130314000001411 |
6 | 140350122040103 |
7 | 12352040326551 |
oct | 1727364024347 |
9 | 417638253143 |
10 | 132000000231 |
11 | 50a87616990 |
12 | 216ba649033 |
13 | c5a834c018 |
14 | 6562d644d1 |
15 | 36787262a6 |
hex | 1ebbd028e7 |
132000000231 has 8 divisors (see below), whose sum is σ = 192000000384. Its totient is φ = 80000000120.
The previous prime is 132000000211. The next prime is 132000000299.
It is a happy number.
132000000231 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132000000231 - 25 = 132000000199 is a prime.
It is a super-2 number, since 2×1320000002312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132000000211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1999999971 + ... + 2000000036.
It is an arithmetic number, because the mean of its divisors is an integer number (24000000048).
Almost surely, 2132000000231 is an apocalyptic number.
132000000231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132000000231 is a deficient number, since it is larger than the sum of its proper divisors (60000000153).
132000000231 is a wasteful number, since it uses less digits than its factorization.
132000000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4000000021.
The product of its (nonzero) digits is 36, while the sum is 12.
It can be divided in two parts, 132000000 and 231, that added together give a palindrome (132000231).
The spelling of 132000000231 in words is "one hundred thirty-two billion, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •