Base | Representation |
---|---|
bin | 1101000100101100101010… |
… | …11000011110111011100001 |
3 | 10202210100110220000101121211 |
4 | 12202112111120132323201 |
5 | 12232004340404213312 |
6 | 141050551500150121 |
7 | 6025012065623665 |
oct | 642262530367341 |
9 | 122710426011554 |
10 | 28748722335457 |
11 | 91842a030a703 |
12 | 3283840b38341 |
13 | 1306cba49a007 |
14 | 7156349868a5 |
15 | 34cc484bb3a7 |
hex | 1a259561eee1 |
28748722335457 has 2 divisors, whose sum is σ = 28748722335458. Its totient is φ = 28748722335456.
The previous prime is 28748722335451. The next prime is 28748722335499. The reversal of 28748722335457 is 75453322784782.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28407951267921 + 340771067536 = 5329911^2 + 583756^2 .
It is a cyclic number.
It is not a de Polignac number, because 28748722335457 - 27 = 28748722335329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 28748722335392 and 28748722335401.
It is not a weakly prime, because it can be changed into another prime (28748722335451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14374361167728 + 14374361167729.
It is an arithmetic number, because the mean of its divisors is an integer number (14374361167729).
Almost surely, 228748722335457 is an apocalyptic number.
It is an amenable number.
28748722335457 is a deficient number, since it is larger than the sum of its proper divisors (1).
28748722335457 is an equidigital number, since it uses as much as digits as its factorization.
28748722335457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 632217600, while the sum is 67.
The spelling of 28748722335457 in words is "twenty-eight trillion, seven hundred forty-eight billion, seven hundred twenty-two million, three hundred thirty-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •