Base | Representation |
---|---|
bin | 1001101100000101100001… |
… | …0100010110110111110100 |
3 | 1101201102020221010001111212 |
4 | 2123001120110112313310 |
5 | 2344014321130010102 |
6 | 34353530530420552 |
7 | 2146440200154650 |
oct | 233013024266764 |
9 | 41642227101455 |
10 | 10653000625652 |
11 | 3437a04148080 |
12 | 1240758431758 |
13 | 5c375c3c8988 |
14 | 28b87242da60 |
15 | 137197cbec52 |
hex | 9b058516df4 |
10653000625652 has 24 divisors (see below), whose sum is σ = 23242910456640. Its totient is φ = 4150519724160.
The previous prime is 10653000625649. The next prime is 10653000625699. The reversal of 10653000625652 is 25652600035601.
It is a super-2 number, since 2×106530006256522 (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 7 ways as a sum of consecutive naturals, for example, 17293831877 + ... + 17293832492.
It is an arithmetic number, because the mean of its divisors is an integer number (968454602360).
Almost surely, 210653000625652 is an apocalyptic number.
It is an amenable number.
10653000625652 is an abundant number, since it is smaller than the sum of its proper divisors (12589909830988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10653000625652 is a wasteful number, since it uses less digits than its factorization.
10653000625652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34587664391 (or 34587664389 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 10653000625652 in words is "ten trillion, six hundred fifty-three billion, six hundred twenty-five thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •