Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0011000001010010111110 |
3 | 1101200200200222220210111111 |
4 | 2122322110303001102332 |
5 | 2343403312343041420 |
6 | 34350235122312234 |
7 | 2146051364403340 |
oct | 232722463012276 |
9 | 41620628823444 |
10 | 10645425362110 |
11 | 34347771004a0 |
12 | 123b1a34b867a |
13 | 5c2b22b78406 |
14 | 28b354329290 |
15 | 136da2c2245a |
hex | 9ae94cc14be |
10645425362110 has 128 divisors (see below), whose sum is σ = 24130653401088. Its totient is φ = 3284640960000.
The previous prime is 10645425362083. The next prime is 10645425362141. The reversal of 10645425362110 is 1126352454601.
10645425362110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×106454253621103 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 892093704 + ... + 892105636.
It is an arithmetic number, because the mean of its divisors is an integer number (188520729696).
Almost surely, 210645425362110 is an apocalyptic number.
10645425362110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10645425362110 is an abundant number, since it is smaller than the sum of its proper divisors (13485228038978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10645425362110 is a wasteful number, since it uses less digits than its factorization.
10645425362110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23530.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 10645425362110 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-five million, three hundred sixty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •