Base | Representation |
---|---|
bin | 11010001001000101… |
… | …001110010010010000 |
3 | 2200110020000001011221 |
4 | 122021011032102100 |
5 | 424441312322400 |
6 | 20521154014424 |
7 | 2012410046644 |
oct | 321105162220 |
9 | 80406001157 |
10 | 28069651600 |
11 | 109a464a781 |
12 | 5534577414 |
13 | 2854496b03 |
14 | 1503d20c24 |
15 | ae4423c1a |
hex | 68914e490 |
28069651600 has 45 divisors (see below), whose sum is σ = 67445389227. Its totient is φ = 11226520320.
The previous prime is 28069651553. The next prime is 28069651601. The reversal of 28069651600 is 615696082.
The square root of 28069651600 is 167540.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 7384308624 + 20685342976 = 85932^2 + 143824^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28069651601) 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 8 ways as a sum of consecutive naturals, for example, 3346612 + ... + 3354988.
Almost surely, 228069651600 is an apocalyptic number.
28069651600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
28069651600 is the 167540-th square number.
It is an amenable number.
28069651600 is an abundant number, since it is smaller than the sum of its proper divisors (39375737627).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28069651600 is an frugal number, since it uses more digits than its factorization.
28069651600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16772 (or 8384 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 28069651600 in words is "twenty-eight billion, sixty-nine million, six hundred fifty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •