Base | Representation |
---|---|
bin | 10011111010100101… |
… | …01001000111100100 |
3 | 1000121010211112110101 |
4 | 21331102221013210 |
5 | 133344121123404 |
6 | 4524542033444 |
7 | 525646163464 |
oct | 117522510744 |
9 | 30533745411 |
10 | 10691973604 |
11 | 4597382024 |
12 | 20a4878884 |
13 | 1015179400 |
14 | 73600bba4 |
15 | 4289e72a4 |
hex | 27d4a91e4 |
10691973604 has 81 divisors (see below), whose sum is σ = 20983498641. Its totient is φ = 4764764160.
The previous prime is 10691973587. The next prime is 10691973613. The reversal of 10691973604 is 40637919601.
It is a happy number.
The square root of 10691973604 is 103402.
It is a perfect power (a square), and thus also a powerful number.
10691973604 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 13 ways, for example, as 10181213604 + 510760000 = 100902^2 + 22600^2 .
It is a super-2 number, since 2×106919736042 (a number of 21 digits) contains 22 as substring.
It is a Duffinian 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 26 ways as a sum of consecutive naturals, for example, 110226484 + ... + 110226580.
Almost surely, 210691973604 is an apocalyptic number.
10691973604 is the 103402-nd square number.
It is an amenable number.
10691973604 is a deficient number, since it is larger than the sum of its proper divisors (10291525037).
10691973604 is an equidigital number, since it uses as much as digits as its factorization.
10691973604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 244944, while the sum is 46.
The spelling of 10691973604 in words is "ten billion, six hundred ninety-one million, nine hundred seventy-three thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •