Base | Representation |
---|---|
bin | 10011110011101111… |
… | …00100011000001010 |
3 | 1000110010202211202002 |
4 | 21321313210120022 |
5 | 133234420412100 |
6 | 4515131111002 |
7 | 524351065232 |
oct | 117167443012 |
9 | 30403684662 |
10 | 10634544650 |
11 | 4567a17884 |
12 | 20895a2462 |
13 | 10062bc792 |
14 | 72c53ccc2 |
15 | 4239512d5 |
hex | 279de460a |
10634544650 has 24 divisors (see below), whose sum is σ = 20943799020. Its totient is φ = 4003592960.
The previous prime is 10634544647. The next prime is 10634544691. The reversal of 10634544650 is 5644543601.
10634544650 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 7088461249 + 3546083401 = 84193^2 + 59549^2 .
It is a super-2 number, since 2×106345446502 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
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 11 ways as a sum of consecutive naturals, for example, 6254765 + ... + 6256464.
Almost surely, 210634544650 is an apocalyptic number.
10634544650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10634544650 is a deficient number, since it is larger than the sum of its proper divisors (10309254370).
10634544650 is a wasteful number, since it uses less digits than its factorization.
10634544650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12511258 (or 12511253 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 10634544650 in words is "ten billion, six hundred thirty-four million, five hundred forty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •