Base | Representation |
---|---|
bin | 1001100011110100001101… |
… | …0000001100001001011000 |
3 | 1101012211111121201120200221 |
4 | 2120331003100030021120 |
5 | 2334202322300301330 |
6 | 34204351422005424 |
7 | 2133250141561264 |
oct | 230750320141130 |
9 | 41184447646627 |
10 | 10510913290840 |
11 | 3392720596446 |
12 | 1219103716874 |
13 | 5b3237261831 |
14 | 284a338d10a4 |
15 | 13362dbd8b7a |
hex | 98f4340c258 |
10510913290840 has 16 divisors (see below), whose sum is σ = 23649554904480. Its totient is φ = 4204365316320.
The previous prime is 10510913290837. The next prime is 10510913290873. The reversal of 10510913290840 is 4809231901501.
It is a super-2 number, since 2×105109132908402 (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 3 ways as a sum of consecutive naturals, for example, 131386416096 + ... + 131386416175.
It is an arithmetic number, because the mean of its divisors is an integer number (1478097181530).
Almost surely, 210510913290840 is an apocalyptic number.
10510913290840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10510913290840 is an abundant number, since it is smaller than the sum of its proper divisors (13138641613640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10510913290840 is a wasteful number, since it uses less digits than its factorization.
10510913290840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262772832282 (or 262772832278 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 43.
The spelling of 10510913290840 in words is "ten trillion, five hundred ten billion, nine hundred thirteen million, two hundred ninety thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •