Base | Representation |
---|---|
bin | 10011111111001100… |
… | …00111111000000000 |
3 | 1000200211120201120202 |
4 | 21333212013320000 |
5 | 133434020303002 |
6 | 4532442424332 |
7 | 526625614265 |
oct | 117746077000 |
9 | 30624521522 |
10 | 10730634752 |
11 | 4607188792 |
12 | 20b58020a8 |
13 | 1020194726 |
14 | 73b1d326c |
15 | 42c0d2502 |
hex | 27f987e00 |
10730634752 has 80 divisors (see below), whose sum is σ = 22233800160. Its totient is φ = 5167669248.
The previous prime is 10730634689. The next prime is 10730634773. The reversal of 10730634752 is 25743603701.
10730634752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 9606098 + ... + 9607214.
It is an arithmetic number, because the mean of its divisors is an integer number (277922502).
Almost surely, 210730634752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10730634752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11116900080).
10730634752 is an abundant number, since it is smaller than the sum of its proper divisors (11503165408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10730634752 is an equidigital number, since it uses as much as digits as its factorization.
10730634752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811 (or 1795 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 38.
The spelling of 10730634752 in words is "ten billion, seven hundred thirty million, six hundred thirty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •