Base | Representation |
---|---|
bin | 1001101100010101010001… |
… | …0100011001100110100000 |
3 | 1101201211011120121002022021 |
4 | 2123011110110121212200 |
5 | 2344102000443322024 |
6 | 34355510240351224 |
7 | 2146650025362301 |
oct | 233052424314640 |
9 | 41654146532267 |
10 | 10657228495264 |
11 | 343978371a09a |
12 | 1241538315514 |
13 | 5c3c842b1a80 |
14 | 28bb53b3c7a8 |
15 | 137344056de4 |
hex | 9b1545199a0 |
10657228495264 has 96 divisors (see below), whose sum is σ = 22700809764864. Its totient is φ = 4895822131200.
The previous prime is 10657228495259. The next prime is 10657228495307. The reversal of 10657228495264 is 46259482275601.
It is a super-2 number, since 2×106572284952642 (a number of 27 digits) contains 22 as substring.
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, 77166817 + ... + 77304799.
It is an arithmetic number, because the mean of its divisors is an integer number (236466768384).
Almost surely, 210657228495264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10657228495264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11350404882432).
10657228495264 is an abundant number, since it is smaller than the sum of its proper divisors (12043581269600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10657228495264 is a wasteful number, since it uses less digits than its factorization.
10657228495264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138870 (or 138862 counting only the distinct ones).
The product of its (nonzero) digits is 58060800, while the sum is 61.
The spelling of 10657228495264 in words is "ten trillion, six hundred fifty-seven billion, two hundred twenty-eight million, four hundred ninety-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •