Base | Representation |
---|---|
bin | 10011110100111011… |
… | …01001010101100000 |
3 | 1000110211112222011201 |
4 | 21322131221111200 |
5 | 133244444321212 |
6 | 4520125050544 |
7 | 524531660521 |
oct | 117235512540 |
9 | 30424488151 |
10 | 10644526432 |
11 | 4572615291 |
12 | 20909b6a54 |
13 | 10083a5c67 |
14 | 72d9ba848 |
15 | 424773b57 |
hex | 27a769560 |
10644526432 has 12 divisors (see below), whose sum is σ = 20956411476. Its totient is φ = 5322263200.
The previous prime is 10644526379. The next prime is 10644526447. The reversal of 10644526432 is 23462544601.
10644526432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×106445264322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10644526391 and 10644526400.
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 as a sum of consecutive naturals, namely, 166320694 + ... + 166320757.
It is an arithmetic number, because the mean of its divisors is an integer number (1746367623).
Almost surely, 210644526432 is an apocalyptic number.
It is an amenable number.
10644526432 is a deficient number, since it is larger than the sum of its proper divisors (10311885044).
10644526432 is an equidigital number, since it uses as much as digits as its factorization.
10644526432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332641461 (or 332641453 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 10644526432 in words is "ten billion, six hundred forty-four million, five hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •