Base | Representation |
---|---|
bin | 1001101001010001101010… |
… | …1100010000010100010100 |
3 | 1101112210122022110221110110 |
4 | 2122110122230100110110 |
5 | 2342221432322000422 |
6 | 34315424141323020 |
7 | 2143110620146566 |
oct | 232243254202424 |
9 | 41483568427413 |
10 | 10604722062612 |
11 | 341948a15a0a7 |
12 | 1233323b66470 |
13 | 5bc03719ca02 |
14 | 2893b25a5336 |
15 | 135cbe61560c |
hex | 9a51ab10514 |
10604722062612 has 48 divisors (see below), whose sum is σ = 25106799844224. Its totient is φ = 3483184320000.
The previous prime is 10604722062577. The next prime is 10604722062629. The reversal of 10604722062612 is 21626022740601.
It is a super-2 number, since 2×106047220626122 (a number of 27 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 15 ways as a sum of consecutive naturals, for example, 1921089 + ... + 4989992.
It is an arithmetic number, because the mean of its divisors is an integer number (523058330088).
Almost surely, 210604722062612 is an apocalyptic number.
10604722062612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10604722062612 is an abundant number, since it is smaller than the sum of its proper divisors (14502077781612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10604722062612 is a wasteful number, since it uses less digits than its factorization.
10604722062612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6912960 (or 6912958 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 39.
The spelling of 10604722062612 in words is "ten trillion, six hundred four billion, seven hundred twenty-two million, sixty-two thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •