Base | Representation |
---|---|
bin | 1101000101011100101100… |
… | …01000110000101001100001 |
3 | 10202212211000201021000202111 |
4 | 12202232112020300221201 |
5 | 12232420141211412341 |
6 | 141110454111515321 |
7 | 6026614024124500 |
oct | 642562610605141 |
9 | 122784021230674 |
10 | 28774504794721 |
11 | 9194220896984 |
12 | 3288837528b41 |
13 | 1309568b5447a |
14 | 71699cc10837 |
15 | 34d756bed681 |
hex | 1a2b96230a61 |
28774504794721 has 24 divisors (see below), whose sum is σ = 33515130713064. Its totient is φ = 24632377862400.
The previous prime is 28774504794703. The next prime is 28774504794809. The reversal of 28774504794721 is 12749740547782.
It can be written as a sum of positive squares in 4 ways, for example, as 11295951293025 + 17478553501696 = 3360945^2 + 4180736^2 .
It is not a de Polignac number, because 28774504794721 - 27 = 28774504794593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (28774504594721) 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 23 ways as a sum of consecutive naturals, for example, 167000611 + ... + 167172823.
It is an arithmetic number, because the mean of its divisors is an integer number (1396463779711).
Almost surely, 228774504794721 is an apocalyptic number.
It is an amenable number.
28774504794721 is a deficient number, since it is larger than the sum of its proper divisors (4740625918343).
28774504794721 is a wasteful number, since it uses less digits than its factorization.
28774504794721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176561 (or 176554 counting only the distinct ones).
The product of its (nonzero) digits is 221276160, while the sum is 67.
The spelling of 28774504794721 in words is "twenty-eight trillion, seven hundred seventy-four billion, five hundred four million, seven hundred ninety-four thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •