Base | Representation |
---|---|
bin | 11010001010111001… |
… | …001111010001100101 |
3 | 2200112100020011122100 |
4 | 122022321033101211 |
5 | 430022104024412 |
6 | 20524201522313 |
7 | 2013226414611 |
oct | 321271172145 |
9 | 80470204570 |
10 | 28100064357 |
11 | 10a0a832292 |
12 | 55427a3399 |
13 | 285a884921 |
14 | 1507d9a341 |
15 | ae6e2eedc |
hex | 68ae4f465 |
28100064357 has 6 divisors (see below), whose sum is σ = 40588981862. Its totient is φ = 18733376232.
The previous prime is 28100064353. The next prime is 28100064361. The reversal of 28100064357 is 75346000182.
28100064357 is a `hidden beast` number, since 2 + 8 + 1 + 0 + 0 + 0 + 643 + 5 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (28100064353) and next prime (28100064361).
It can be written as a sum of positive squares in only one way, i.e., 16630939521 + 11469124836 = 128961^2 + 107094^2 .
It is not a de Polignac number, because 28100064357 - 22 = 28100064353 is a prime.
It is a super-2 number, since 2×281000643572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28100064353) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1561114678 + ... + 1561114695.
Almost surely, 228100064357 is an apocalyptic number.
It is an amenable number.
28100064357 is a deficient number, since it is larger than the sum of its proper divisors (12488917505).
28100064357 is a wasteful number, since it uses less digits than its factorization.
28100064357 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3122229379 (or 3122229376 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 28100064357 in words is "twenty-eight billion, one hundred million, sixty-four thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •