Base | Representation |
---|---|
bin | 10011010001000110… |
… | …01111101101000110 |
3 | 222200220001212110220 |
4 | 21220203033231012 |
5 | 132141031120142 |
6 | 4430231525210 |
7 | 514222405203 |
oct | 115043175506 |
9 | 28626055426 |
10 | 10344004422 |
11 | 4428a14694 |
12 | 2008229806 |
13 | c8b05469b |
14 | 701b0ccaa |
15 | 4081b02ec |
hex | 2688cfb46 |
10344004422 has 32 divisors (see below), whose sum is σ = 21509053440. Its totient is φ = 3312761760.
The previous prime is 10344004393. The next prime is 10344004457. The reversal of 10344004422 is 22440044301.
It is a happy number.
10344004422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10344004392 and 10344004401.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 174193 + ... + 225900.
It is an arithmetic number, because the mean of its divisors is an integer number (672157920).
Almost surely, 210344004422 is an apocalyptic number.
10344004422 is an abundant number, since it is smaller than the sum of its proper divisors (11165049018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10344004422 is a wasteful number, since it uses less digits than its factorization.
10344004422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400268.
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 10344004422 its reverse (22440044301), we get a palindrome (32784048723).
It can be divided in two parts, 10344004 and 422, that added together give a triangular number (10344426 = T4548).
The spelling of 10344004422 in words is "ten billion, three hundred forty-four million, four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •