Base | Representation |
---|---|
bin | 11010111100100010… |
… | …011110001111010100 |
3 | 2202200101110111202012 |
4 | 122330202132033110 |
5 | 433223314112030 |
6 | 21142553403352 |
7 | 2042662035503 |
oct | 327442361724 |
9 | 82611414665 |
10 | 28932957140 |
11 | 112a7999a2a |
12 | 5735709558 |
13 | 29612b33a9 |
14 | 158684883a |
15 | b45103095 |
hex | 6bc89e3d4 |
28932957140 has 12 divisors (see below), whose sum is σ = 60759210036. Its totient is φ = 11573182848.
The previous prime is 28932957089. The next prime is 28932957149. The reversal of 28932957140 is 4175923982.
It can be written as a sum of positive squares in 2 ways, for example, as 16994772496 + 11938184644 = 130364^2 + 109262^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28932957149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 723323909 + ... + 723323948.
It is an arithmetic number, because the mean of its divisors is an integer number (5063267503).
Almost surely, 228932957140 is an apocalyptic number.
28932957140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
28932957140 is an abundant number, since it is smaller than the sum of its proper divisors (31826252896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28932957140 is a wasteful number, since it uses less digits than its factorization.
28932957140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1446647866 (or 1446647864 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 28932957140 in words is "twenty-eight billion, nine hundred thirty-two million, nine hundred fifty-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •