Base | Representation |
---|---|
bin | 1100111100111101011011… |
… | …10111011010000010100111 |
3 | 10201211221012110010120011122 |
4 | 12132132231313122002213 |
5 | 12213130331322411402 |
6 | 140324501032524155 |
7 | 5666550311614202 |
oct | 636365567320247 |
9 | 121757173116148 |
10 | 28482845122727 |
11 | 9091563586546 |
12 | 32401bb25065b |
13 | 12b7bc7c166b8 |
14 | 706811646939 |
15 | 345d86862ca2 |
hex | 19e7addda0a7 |
28482845122727 has 2 divisors, whose sum is σ = 28482845122728. Its totient is φ = 28482845122726.
The previous prime is 28482845122709. The next prime is 28482845122729. The reversal of 28482845122727 is 72722154828482.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 28482845122727 - 212 = 28482845118631 is a prime.
It is a super-2 number, since 2×284828451227272 (a number of 28 digits) contains 22 as substring.
Together with 28482845122729, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 28482845122727.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28482845122729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14241422561363 + 14241422561364.
It is an arithmetic number, because the mean of its divisors is an integer number (14241422561364).
Almost surely, 228482845122727 is an apocalyptic number.
28482845122727 is a deficient number, since it is larger than the sum of its proper divisors (1).
28482845122727 is an equidigital number, since it uses as much as digits as its factorization.
28482845122727 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 64225280, while the sum is 62.
The spelling of 28482845122727 in words is "twenty-eight trillion, four hundred eighty-two billion, eight hundred forty-five million, one hundred twenty-two thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •