Base | Representation |
---|---|
bin | 11110000110111111110011… |
… | …100001000001101101100111 |
3 | 122100212102220100110110112121 |
4 | 132012333303201001231213 |
5 | 114324101202342133411 |
6 | 1145345532402330411 |
7 | 36615122053665352 |
oct | 3606776341015547 |
9 | 570772810413477 |
10 | 132422222224231 |
11 | 39214a49229385 |
12 | 12a28392359a07 |
13 | 58b74923457a4 |
14 | 249b3ac2bb299 |
15 | 1049914d47571 |
hex | 786ff3841b67 |
132422222224231 has 4 divisors (see below), whose sum is σ = 133733333335464. Its totient is φ = 131111111113000.
The previous prime is 132422222224211. The next prime is 132422222224301.
132422222224231 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 132422222224231 - 215 = 132422222191463 is a prime.
It is a super-4 number, since 4×1324222222242314 (a number of 58 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132422222224211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 655555555465 + ... + 655555555666.
It is an arithmetic number, because the mean of its divisors is an integer number (33433333333866).
Almost surely, 2132422222224231 is an apocalyptic number.
132422222224231 is a deficient number, since it is larger than the sum of its proper divisors (1311111111233).
132422222224231 is a wasteful number, since it uses less digits than its factorization.
132422222224231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311111111232.
The product of its digits is 73728, while the sum is 34.
The spelling of 132422222224231 in words is "one hundred thirty-two trillion, four hundred twenty-two billion, two hundred twenty-two million, two hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •