Base | Representation |
---|---|
bin | 111101101011001001… |
… | …0100101010001000111 |
3 | 110122212021011012100222 |
4 | 1323112102211101013 |
5 | 4132221204324333 |
6 | 140502151054555 |
7 | 12366043150460 |
oct | 1732622452107 |
9 | 418767135328 |
10 | 132444214343 |
11 | 51195340591 |
12 | 2180337145b |
13 | c6493a12cc |
14 | 65a5d57d67 |
15 | 36a2720298 |
hex | 1ed64a5447 |
132444214343 has 4 divisors (see below), whose sum is σ = 151364816400. Its totient is φ = 113523612288.
The previous prime is 132444214321. The next prime is 132444214349. The reversal of 132444214343 is 343412444231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 343412444231 = 294563 ⋅1165837.
It is a cyclic number.
It is not a de Polignac number, because 132444214343 - 224 = 132427437127 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132444214349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9460301018 + ... + 9460301031.
It is an arithmetic number, because the mean of its divisors is an integer number (37841204100).
Almost surely, 2132444214343 is an apocalyptic number.
132444214343 is a deficient number, since it is larger than the sum of its proper divisors (18920602057).
132444214343 is an equidigital number, since it uses as much as digits as its factorization.
132444214343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18920602056.
The product of its digits is 110592, while the sum is 35.
Adding to 132444214343 its reverse (343412444231), we get a palindrome (475856658574).
The spelling of 132444214343 in words is "one hundred thirty-two billion, four hundred forty-four million, two hundred fourteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •