Base | Representation |
---|---|
bin | 10011111011111101… |
… | …00110011000000000 |
3 | 1000121221111222011212 |
4 | 21331332212120000 |
5 | 133410043343304 |
6 | 4530033025252 |
7 | 526146135515 |
oct | 117576463000 |
9 | 30557458155 |
10 | 10703496704 |
11 | 45a293254a |
12 | 20a86b5228 |
13 | 1017682304 |
14 | 73776b30c |
15 | 429a2166e |
hex | 27dfa6600 |
10703496704 has 80 divisors (see below), whose sum is σ = 22298764752. Its totient is φ = 5128101888.
The previous prime is 10703496649. The next prime is 10703496733. The reversal of 10703496704 is 40769430701.
10703496704 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×107034967042 (a number of 21 digits) contains 22 as substring.
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, 1162262 + ... + 1171434.
Almost surely, 210703496704 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 10703496704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11149382376).
10703496704 is an abundant number, since it is smaller than the sum of its proper divisors (11595268048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10703496704 is an frugal number, since it uses more digits than its factorization.
10703496704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9287 (or 9271 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 10703496704 in words is "ten billion, seven hundred three million, four hundred ninety-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •