Base | Representation |
---|---|
bin | 111101110000001101… |
… | …1110110011101100111 |
3 | 110200022010102100110121 |
4 | 1323200123312131213 |
5 | 4133043242304411 |
6 | 140531111102411 |
7 | 12403210640053 |
oct | 1734033663547 |
9 | 420263370417 |
10 | 132614416231 |
11 | 51272420800 |
12 | 21850371a07 |
13 | c67572449b |
14 | 65c07c0c63 |
15 | 36b2640571 |
hex | 1ee06f6767 |
132614416231 has 24 divisors (see below), whose sum is σ = 146196100400. Its totient is φ = 120203740800.
The previous prime is 132614416177. The next prime is 132614416283.
132614416231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 132614416231 - 29 = 132614415719 is a prime.
It is a super-2 number, since 2×1326144162312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132644416231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 113248276 + ... + 113249446.
Almost surely, 2132614416231 is an apocalyptic number.
132614416231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132614416231 is a deficient number, since it is larger than the sum of its proper divisors (13581684169).
132614416231 is a wasteful number, since it uses less digits than its factorization.
132614416231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3151 (or 3140 counting only the distinct ones).
The product of its digits is 20736, while the sum is 34.
It can be divided in two parts, 132614 and 416231, that added together give a palindrome (548845).
The spelling of 132614416231 in words is "one hundred thirty-two billion, six hundred fourteen million, four hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •