Base | Representation |
---|---|
bin | 10100000100010010… |
… | …01100110011110000 |
3 | 1000210211000122010020 |
4 | 22002021030303300 |
5 | 134030441300212 |
6 | 4541011003440 |
7 | 530655154026 |
oct | 120211146360 |
9 | 30724018106 |
10 | 10773384432 |
11 | 46293271a8 |
12 | 2107b99580 |
13 | 1028cb19b5 |
14 | 742b60716 |
15 | 430c28d8c |
hex | 28224ccf0 |
10773384432 has 160 divisors (see below), whose sum is σ = 30263777280. Its totient is φ = 3289251840.
The previous prime is 10773384397. The next prime is 10773384497. The reversal of 10773384432 is 23448337701.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16806832 + ... + 16807472.
It is an arithmetic number, because the mean of its divisors is an integer number (189148608).
Almost surely, 210773384432 is an apocalyptic number.
10773384432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10773384432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15131888640).
10773384432 is an abundant number, since it is smaller than the sum of its proper divisors (19490392848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10773384432 is a wasteful number, since it uses less digits than its factorization.
10773384432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191 (or 1185 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 42.
The spelling of 10773384432 in words is "ten billion, seven hundred seventy-three million, three hundred eighty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •