Base | Representation |
---|---|
bin | 11010100110110001… |
… | …011000001000100000 |
3 | 2201201221021212001020 |
4 | 122212301120020200 |
5 | 432001321444121 |
6 | 21042430205440 |
7 | 2030636000112 |
oct | 324661301040 |
9 | 81657255036 |
10 | 28567765536 |
11 | 1112a839092 |
12 | 5653353880 |
13 | 290373b59b |
14 | 15501453b2 |
15 | b230181c6 |
hex | 6a6c58220 |
28567765536 has 24 divisors (see below), whose sum is σ = 74990384784. Its totient is φ = 9522588480.
The previous prime is 28567765531. The next prime is 28567765547. The reversal of 28567765536 is 63556776582.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×285677655362 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28567765536.
It is not an unprimeable number, because it can be changed into a prime (28567765531) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 148790350 + ... + 148790541.
It is an arithmetic number, because the mean of its divisors is an integer number (3124599366).
Almost surely, 228567765536 is an apocalyptic number.
It is an amenable number.
28567765536 is an abundant number, since it is smaller than the sum of its proper divisors (46422619248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28567765536 is a wasteful number, since it uses less digits than its factorization.
28567765536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297580904 (or 297580896 counting only the distinct ones).
The product of its digits is 63504000, while the sum is 60.
The spelling of 28567765536 in words is "twenty-eight billion, five hundred sixty-seven million, seven hundred sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •