Base | Representation |
---|---|
bin | 11010011001010010… |
… | …110011000110111000 |
3 | 2201011011210210000102 |
4 | 122121102303012320 |
5 | 431020430131002 |
6 | 21004151454532 |
7 | 2022222004550 |
oct | 323122630670 |
9 | 81134723012 |
10 | 28341645752 |
11 | 11024135a32 |
12 | 55ab687448 |
13 | 289893a4b4 |
14 | 152c0c4160 |
15 | b0d24ea02 |
hex | 6994b31b8 |
28341645752 has 32 divisors (see below), whose sum is σ = 60738577920. Its totient is φ = 12145123680.
The previous prime is 28341645737. The next prime is 28341645767. The reversal of 28341645752 is 25754614382.
It is an interprime number because it is at equal distance from previous prime (28341645737) and next prime (28341645767).
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 28341645697 and 28341645706.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 655013 + ... + 696939.
It is an arithmetic number, because the mean of its divisors is an integer number (1898080560).
Almost surely, 228341645752 is an apocalyptic number.
It is an amenable number.
28341645752 is an abundant number, since it is smaller than the sum of its proper divisors (32396932168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28341645752 is a wasteful number, since it uses less digits than its factorization.
28341645752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54011 (or 54007 counting only the distinct ones).
The product of its digits is 1612800, while the sum is 47.
The spelling of 28341645752 in words is "twenty-eight billion, three hundred forty-one million, six hundred forty-five thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •