Base | Representation |
---|---|
bin | 10101010010111110… |
… | …00111101101010100 |
3 | 1002111211001001001201 |
4 | 22221133013231110 |
5 | 141403430122012 |
6 | 5130310202244 |
7 | 553221440350 |
oct | 125137075524 |
9 | 32454031051 |
10 | 11433442132 |
11 | 4937975332 |
12 | 2271053384 |
13 | 1102977898 |
14 | 7a669c460 |
15 | 46db5b857 |
hex | 2a97c7b54 |
11433442132 has 24 divisors (see below), whose sum is σ = 22953845376. Its totient is φ = 4881412128.
The previous prime is 11433442091. The next prime is 11433442133. The reversal of 11433442132 is 23124433411.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 11433442132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11433442133) 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 7 ways as a sum of consecutive naturals, for example, 768943 + ... + 783670.
It is an arithmetic number, because the mean of its divisors is an integer number (956410224).
Almost surely, 211433442132 is an apocalyptic number.
It is an amenable number.
11433442132 is an abundant number, since it is smaller than the sum of its proper divisors (11520403244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11433442132 is a wasteful number, since it uses less digits than its factorization.
11433442132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552887 (or 1552885 counting only the distinct ones).
The product of its digits is 6912, while the sum is 28.
Adding to 11433442132 its reverse (23124433411), we get a palindrome (34557875543).
The spelling of 11433442132 in words is "eleven billion, four hundred thirty-three million, four hundred forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •