Base | Representation |
---|---|
bin | 111101011111110100… |
… | …1111011110111000111 |
3 | 110121212210120200122212 |
4 | 1322333221323313013 |
5 | 4130432000211411 |
6 | 140400343414035 |
7 | 12353452250564 |
oct | 1727751736707 |
9 | 417783520585 |
10 | 132064460231 |
11 | 5100aa43710 |
12 | 2171815431b |
13 | c5b87cb032 |
14 | 656b74386b |
15 | 367e20a68b |
hex | 1ebfa7bdc7 |
132064460231 has 8 divisors (see below), whose sum is σ = 147420793344. Its totient is φ = 117266539320.
The previous prime is 132064460207. The next prime is 132064460233.
132064460231 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 132064460231 - 26 = 132064460167 is a prime.
It is a super-2 number, since 2×1320644602312 (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 (132064460233) 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, 139602551 + ... + 139603496.
It is an arithmetic number, because the mean of its divisors is an integer number (18427599168).
Almost surely, 2132064460231 is an apocalyptic number.
132064460231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132064460231 is a deficient number, since it is larger than the sum of its proper divisors (15356333113).
132064460231 is a wasteful number, since it uses less digits than its factorization.
132064460231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279206101.
The product of its (nonzero) digits is 20736, while the sum is 32.
It can be divided in two parts, 132064 and 460231, that added together give a palindrome (592295).
The spelling of 132064460231 in words is "one hundred thirty-two billion, sixty-four million, four hundred sixty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •