Base | Representation |
---|---|
bin | 100110111010101… |
… | …110010010001100 |
3 | 1200111121012000201 |
4 | 212322232102030 |
5 | 2314122200030 |
6 | 144442303244 |
7 | 22115540404 |
oct | 4672562214 |
9 | 1614535021 |
10 | 652928140 |
11 | 305619637 |
12 | 1627b7b24 |
13 | a536aa17 |
14 | 62a03804 |
15 | 3c4c52ca |
hex | 26eae48c |
652928140 has 48 divisors (see below), whose sum is σ = 1454281920. Its totient is φ = 245710080.
The previous prime is 652928113. The next prime is 652928153. The reversal of 652928140 is 41829256.
652928140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 652928140.
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, 16426 + ... + 39694.
It is an arithmetic number, because the mean of its divisors is an integer number (30297540).
Almost surely, 2652928140 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 652928140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (727140960).
652928140 is an abundant number, since it is smaller than the sum of its proper divisors (801353780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
652928140 is a wasteful number, since it uses less digits than its factorization.
652928140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23362 (or 23360 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 37.
The square root of 652928140 is about 25552.4585901240. The cubic root of 652928140 is about 867.5379105148.
The spelling of 652928140 in words is "six hundred fifty-two million, nine hundred twenty-eight thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •