Base | Representation |
---|---|
bin | 1101000101000101011011… |
… | …00100001000111001001001 |
3 | 10202211121210010122100210111 |
4 | 12202202231210020321021 |
5 | 12232214100303232433 |
6 | 141101030352114321 |
7 | 6025662331143445 |
oct | 642425544107111 |
9 | 122747703570714 |
10 | 28762012945993 |
11 | 91899a0536058 |
12 | 328632bb359a1 |
13 | 1308327b2cac2 |
14 | 716135b5d825 |
15 | 34d2751c4dcd |
hex | 1a28ad908e49 |
28762012945993 has 2 divisors, whose sum is σ = 28762012945994. Its totient is φ = 28762012945992.
The previous prime is 28762012945987. The next prime is 28762012946057. The reversal of 28762012945993 is 39954921026782.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28732515913984 + 29497032009 = 5360272^2 + 171747^2 .
It is a cyclic number.
It is not a de Polignac number, because 28762012945993 - 29 = 28762012945481 is a prime.
It is not a weakly prime, because it can be changed into another prime (28762012945903) 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 as a sum of consecutive naturals, namely, 14381006472996 + 14381006472997.
It is an arithmetic number, because the mean of its divisors is an integer number (14381006472997).
It is a 1-persistent number, because it is pandigital, but 2⋅28762012945993 = 57524025891986 is not.
Almost surely, 228762012945993 is an apocalyptic number.
It is an amenable number.
28762012945993 is a deficient number, since it is larger than the sum of its proper divisors (1).
28762012945993 is an equidigital number, since it uses as much as digits as its factorization.
28762012945993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117573120, while the sum is 67.
The spelling of 28762012945993 in words is "twenty-eight trillion, seven hundred sixty-two billion, twelve million, nine hundred forty-five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •