Base | Representation |
---|---|
bin | 1001011110111000010011… |
… | …1110100101010011011000 |
3 | 1100220201121222211200000201 |
4 | 2113232010332211103120 |
5 | 2331310141324004444 |
6 | 34101405235111544 |
7 | 2124155614036060 |
oct | 227560476452330 |
9 | 40821558750021 |
10 | 10426116625624 |
11 | 335a767032837 |
12 | 12047994425b4 |
13 | 5a824245229b |
14 | 2808abaa43a0 |
15 | 13131957add4 |
hex | 97b84fa54d8 |
10426116625624 has 64 divisors (see below), whose sum is σ = 23781798720000. Its totient is φ = 4185596498688.
The previous prime is 10426116625601. The next prime is 10426116625651. The reversal of 10426116625624 is 42652661162401.
It is a super-2 number, since 2×104261166256242 (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 (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54955764 + ... + 55145155.
It is an arithmetic number, because the mean of its divisors is an integer number (371590605000).
Almost surely, 210426116625624 is an apocalyptic number.
10426116625624 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10426116625624 is an abundant number, since it is smaller than the sum of its proper divisors (13355682094376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10426116625624 is a wasteful number, since it uses less digits than its factorization.
10426116625624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110101040 (or 110101036 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 46.
The spelling of 10426116625624 in words is "ten trillion, four hundred twenty-six billion, one hundred sixteen million, six hundred twenty-five thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •