Base | Representation |
---|---|
bin | 1001101001100001101111… |
… | …0111101110101001110100 |
3 | 1101120012210000110001222010 |
4 | 2122120123313232221310 |
5 | 2342304301411034324 |
6 | 34321420233404220 |
7 | 2143322552014530 |
oct | 232303367565164 |
9 | 41505700401863 |
10 | 10609036814964 |
11 | 34202a3783435 |
12 | 1234128b69670 |
13 | 5bc574085c03 |
14 | 2896a164cbc0 |
15 | 135e73310829 |
hex | 9a61bdeea74 |
10609036814964 has 48 divisors (see below), whose sum is σ = 28290924950400. Its totient is φ = 3031136221056.
The previous prime is 10609036814879. The next prime is 10609036814993. The reversal of 10609036814964 is 46941863090601.
It is a super-2 number, since 2×106090368149642 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26647882 + ... + 27043070.
It is an arithmetic number, because the mean of its divisors is an integer number (589394269800).
Almost surely, 210609036814964 is an apocalyptic number.
10609036814964 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10609036814964 is an abundant number, since it is smaller than the sum of its proper divisors (17681888135436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10609036814964 is a wasteful number, since it uses less digits than its factorization.
10609036814964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714792 (or 714790 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 57.
The spelling of 10609036814964 in words is "ten trillion, six hundred nine billion, thirty-six million, eight hundred fourteen thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •