Base | Representation |
---|---|
bin | 1001011011101111… |
… | …1101100100000000 |
3 | 20112110222020000000 |
4 | 2112323331210000 |
5 | 20141232113211 |
6 | 1055140000000 |
7 | 116516126625 |
oct | 22673754400 |
9 | 6473866000 |
10 | 2532301056 |
11 | 108a46629a |
12 | 5a8090000 |
13 | 31482b8bc |
14 | 1a045c34c |
15 | ec4ab656 |
hex | 96efd900 |
2532301056 has 144 divisors (see below), whose sum is σ = 7582585920. Its totient is φ = 843913728.
The previous prime is 2532301049. The next prime is 2532301067. The reversal of 2532301056 is 6501032352.
2532301056 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 557611 + ... + 562133.
Almost surely, 22532301056 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 2532301056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3791292960).
2532301056 is an abundant number, since it is smaller than the sum of its proper divisors (5050284864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2532301056 is an frugal number, since it uses more digits than its factorization.
2532301056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4560 (or 4528 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 2532301056 is about 50321.9738881535. The cubic root of 2532301056 is about 1363.0290501760.
The spelling of 2532301056 in words is "two billion, five hundred thirty-two million, three hundred one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.925 sec. • engine limits •