Base | Representation |
---|---|
bin | 1011011000100111… |
… | …0101101011000100 |
3 | 21212222110112102010 |
4 | 2312021311223010 |
5 | 22224321014302 |
6 | 1223125214220 |
7 | 135505563414 |
oct | 26611655304 |
9 | 7788415363 |
10 | 3056032452 |
11 | 1329061460 |
12 | 713561370 |
13 | 3991a2635 |
14 | 20dc30644 |
15 | 12d46116c |
hex | b6275ac4 |
3056032452 has 96 divisors (see below), whose sum is σ = 8092643328. Its totient is φ = 889200000.
The previous prime is 3056032439. The next prime is 3056032487. The reversal of 3056032452 is 2542306503.
3056032452 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 533202 + ... + 538902.
It is an arithmetic number, because the mean of its divisors is an integer number (84298368).
Almost surely, 23056032452 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 3056032452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4046321664).
3056032452 is an abundant number, since it is smaller than the sum of its proper divisors (5036610876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3056032452 is a wasteful number, since it uses less digits than its factorization.
3056032452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5881 (or 5879 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
The square root of 3056032452 is about 55281.3933616004. The cubic root of 3056032452 is about 1451.1734380692.
Adding to 3056032452 its reverse (2542306503), we get a palindrome (5598338955).
The spelling of 3056032452 in words is "three billion, fifty-six million, thirty-two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •