Base | Representation |
---|---|
bin | 1100110011110011100010… |
… | …10000000101001111100111 |
3 | 10200201212021221122120222112 |
4 | 12121321301100011033213 |
5 | 12143002132131141414 |
6 | 135524200352151235 |
7 | 5635043423535632 |
oct | 631716120051747 |
9 | 120655257576875 |
10 | 28168295568359 |
11 | 8a8011a558751 |
12 | 31ab25523851b |
13 | 129434999352b |
14 | 6d54d2056c19 |
15 | 33cac6bb9d3e |
hex | 199e714053e7 |
28168295568359 has 2 divisors, whose sum is σ = 28168295568360. Its totient is φ = 28168295568358.
The previous prime is 28168295568349. The next prime is 28168295568409. The reversal of 28168295568359 is 95386559286182.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 28168295568359 - 212 = 28168295564263 is a prime.
It is a super-3 number, since 3×281682955683593 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28168295568359.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28168295568349) 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, 14084147784179 + 14084147784180.
It is an arithmetic number, because the mean of its divisors is an integer number (14084147784180).
Almost surely, 228168295568359 is an apocalyptic number.
28168295568359 is a deficient number, since it is larger than the sum of its proper divisors (1).
28168295568359 is an equidigital number, since it uses as much as digits as its factorization.
28168295568359 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488000, while the sum is 77.
The spelling of 28168295568359 in words is "twenty-eight trillion, one hundred sixty-eight billion, two hundred ninety-five million, five hundred sixty-eight thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •