Base | Representation |
---|---|
bin | 10000011010111101001… |
… | …10000000001000001000 |
3 | 1222221101000000202121020 |
4 | 20031132212000020020 |
5 | 33221014300023242 |
6 | 1111111434312440 |
7 | 55523042424240 |
oct | 10153646001010 |
9 | 1887330022536 |
10 | 564227736072 |
11 | 1a8318936210 |
12 | 91426888720 |
13 | 4128b745330 |
14 | 1d44738cb20 |
15 | ea245e36ec |
hex | 835e980208 |
564227736072 has 512 divisors, whose sum is σ = 1960256471040. Its totient is φ = 130564224000.
The previous prime is 564227736047. The next prime is 564227736089. The reversal of 564227736072 is 270637722465.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 365668533 + ... + 365670075.
It is an arithmetic number, because the mean of its divisors is an integer number (3828625920).
Almost surely, 2564227736072 is an apocalyptic number.
564227736072 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 564227736072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (980128235520).
564227736072 is an abundant number, since it is smaller than the sum of its proper divisors (1396028734968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
564227736072 is a wasteful number, since it uses less digits than its factorization.
564227736072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2105 (or 2101 counting only the distinct ones).
The product of its (nonzero) digits is 5927040, while the sum is 51.
The spelling of 564227736072 in words is "five hundred sixty-four billion, two hundred twenty-seven million, seven hundred thirty-six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •