Base | Representation |
---|---|
bin | 111101100100100101… |
… | …1000101000000110011 |
3 | 110122021221001102210201 |
4 | 1323021023011000303 |
5 | 4131243340042121 |
6 | 140424250140031 |
7 | 12360431450323 |
oct | 1731113050063 |
9 | 418257042721 |
10 | 132224143411 |
11 | 51092099a88 |
12 | 21761721617 |
13 | c61290a519 |
14 | 6584a2d283 |
15 | 368d24de91 |
hex | 1ec92c5033 |
132224143411 has 8 divisors (see below), whose sum is σ = 133494150240. Its totient is φ = 130959949632.
The previous prime is 132224143399. The next prime is 132224143459. The reversal of 132224143411 is 114341422231.
It is a happy number.
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 132224143411 - 211 = 132224141363 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132224143411.
It is not an unprimeable number, because it can be changed into a prime (132224183411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1407546 + ... + 1498543.
It is an arithmetic number, because the mean of its divisors is an integer number (16686768780).
Almost surely, 2132224143411 is an apocalyptic number.
132224143411 is a deficient number, since it is larger than the sum of its proper divisors (1270006829).
132224143411 is a wasteful number, since it uses less digits than its factorization.
132224143411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906525.
The product of its digits is 4608, while the sum is 28.
Adding to 132224143411 its reverse (114341422231), we get a palindrome (246565565642).
The spelling of 132224143411 in words is "one hundred thirty-two billion, two hundred twenty-four million, one hundred forty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •