Base | Representation |
---|---|
bin | 1000100001000101… |
… | …01001100010001100 |
3 | 102210122221100021220 |
4 | 10100202221202030 |
5 | 33331024021042 |
6 | 2033420123340 |
7 | 221211326211 |
oct | 42042514214 |
9 | 12718840256 |
10 | 4572485772 |
11 | 1a3705a268 |
12 | a77396550 |
13 | 57b4058aa |
14 | 3153b7b08 |
15 | 1bb65a8ec |
hex | 1108a988c |
4572485772 has 12 divisors (see below), whose sum is σ = 10669133496. Its totient is φ = 1524161920.
The previous prime is 4572485737. The next prime is 4572485777. The reversal of 4572485772 is 2775842754.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×45724857722 = 41815252270284871968, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4572485777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 190520229 + ... + 190520252.
It is an arithmetic number, because the mean of its divisors is an integer number (889094458).
Almost surely, 24572485772 is an apocalyptic number.
It is an amenable number.
4572485772 is an abundant number, since it is smaller than the sum of its proper divisors (6096647724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4572485772 is a wasteful number, since it uses less digits than its factorization.
4572485772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381040488 (or 381040486 counting only the distinct ones).
The product of its digits is 4390400, while the sum is 51.
The square root of 4572485772 is about 67620.1580299839. The cubic root of 4572485772 is about 1659.7809954462.
The spelling of 4572485772 in words is "four billion, five hundred seventy-two million, four hundred eighty-five thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •