Base | Representation |
---|---|
bin | 1001101110100111001110… |
… | …0000100001000101000000 |
3 | 1101212120021221212110110202 |
4 | 2123221303200201011000 |
5 | 2400222220024032401 |
6 | 34425510012344332 |
7 | 2152534631566652 |
oct | 233516340410500 |
9 | 41776257773422 |
10 | 10696406470976 |
11 | 3454358664116 |
12 | 1249050a750a8 |
13 | 5c7888c6c815 |
14 | 28d9cd08a6d2 |
15 | 1383887b606b |
hex | 9ba73821140 |
10696406470976 has 28 divisors (see below), whose sum is σ = 22148537315232. Its totient is φ = 5115672659328.
The previous prime is 10696406470949. The next prime is 10696406470979. The reversal of 10696406470976 is 67907460469601.
It is a super-2 number, since 2×106964064709762 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10696406470979) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3633288770 + ... + 3633291713.
Almost surely, 210696406470976 is an apocalyptic number.
10696406470976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10696406470976 is an abundant number, since it is smaller than the sum of its proper divisors (11452130844256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10696406470976 is an equidigital number, since it uses as much as digits as its factorization.
10696406470976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7266580518 (or 7266580508 counting only the distinct ones).
The product of its (nonzero) digits is 82301184, while the sum is 65.
The spelling of 10696406470976 in words is "ten trillion, six hundred ninety-six billion, four hundred six million, four hundred seventy thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •