Base | Representation |
---|---|
bin | 10101000101111110… |
… | …01010101010010010 |
3 | 1002020012212020120020 |
4 | 22202333022222102 |
5 | 141143021333242 |
6 | 5111413124310 |
7 | 550425555132 |
oct | 124277125222 |
9 | 32205766506 |
10 | 11324402322 |
11 | 489136a092 |
12 | 2240629696 |
13 | 10b61ba59c |
14 | 795dd6ac2 |
15 | 4642bd6ec |
hex | 2a2fcaa92 |
11324402322 has 8 divisors (see below), whose sum is σ = 22648804656. Its totient is φ = 3774800772.
The previous prime is 11324402317. The next prime is 11324402333. The reversal of 11324402322 is 22320442311.
It is a happy number.
11324402322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11324402322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11324402292 and 11324402301.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 943700188 + ... + 943700199.
It is an arithmetic number, because the mean of its divisors is an integer number (2831100582).
Almost surely, 211324402322 is an apocalyptic number.
11324402322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11324402322 is a wasteful number, since it uses less digits than its factorization.
11324402322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1887400392.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 11324402322 its reverse (22320442311), we get a palindrome (33644844633).
The spelling of 11324402322 in words is "eleven billion, three hundred twenty-four million, four hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •