Base | Representation |
---|---|
bin | 1101000000110011011001… |
… | …01000011001100001110001 |
3 | 10202022120001012121212100102 |
4 | 12200121230220121201301 |
5 | 12222311301012434401 |
6 | 140505300124402145 |
7 | 6012233523254102 |
oct | 640315450314161 |
9 | 122276035555312 |
10 | 28614894655601 |
11 | 9132566053aa1 |
12 | 32619123a6355 |
13 | 12c74b05b9177 |
14 | 70cd7adc23a9 |
15 | 3495145c056b |
hex | 1a066ca19871 |
28614894655601 has 2 divisors, whose sum is σ = 28614894655602. Its totient is φ = 28614894655600.
The previous prime is 28614894655583. The next prime is 28614894655631. The reversal of 28614894655601 is 10655649841682.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24086510655601 + 4528384000000 = 4907801^2 + 2128000^2 .
It is a cyclic number.
It is not a de Polignac number, because 28614894655601 - 242 = 24216848144497 is a prime.
It is a super-2 number, since 2×286148946556012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (28614894655631) 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, 14307447327800 + 14307447327801.
It is an arithmetic number, because the mean of its divisors is an integer number (14307447327801).
Almost surely, 228614894655601 is an apocalyptic number.
It is an amenable number.
28614894655601 is a deficient number, since it is larger than the sum of its proper divisors (1).
28614894655601 is an equidigital number, since it uses as much as digits as its factorization.
28614894655601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 99532800, while the sum is 65.
The spelling of 28614894655601 in words is "twenty-eight trillion, six hundred fourteen billion, eight hundred ninety-four million, six hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •