Base | Representation |
---|---|
bin | 1001010110110111110111… |
… | …0000000111001001000001 |
3 | 1100102120120012002002202212 |
4 | 2111231331300013021001 |
5 | 2322031430422004311 |
6 | 33514255250551505 |
7 | 2111216006530445 |
oct | 225557560071101 |
9 | 40376505062685 |
10 | 10288556438081 |
11 | 3307396983929 |
12 | 11a1ba8898595 |
13 | 59828c1a82cc |
14 | 277d7c4da825 |
15 | 12c967b46c8b |
hex | 95b7dc07241 |
10288556438081 has 2 divisors, whose sum is σ = 10288556438082. Its totient is φ = 10288556438080.
The previous prime is 10288556438057. The next prime is 10288556438123. The reversal of 10288556438081 is 18083465588201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9952504348081 + 336052090000 = 3154759^2 + 579700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10288556438081 is a prime.
It is a super-2 number, since 2×102885564380812 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10288556438081.
It is not a weakly prime, because it can be changed into another prime (10288556738081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5144278219040 + 5144278219041.
It is an arithmetic number, because the mean of its divisors is an integer number (5144278219041).
Almost surely, 210288556438081 is an apocalyptic number.
It is an amenable number.
10288556438081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10288556438081 is an equidigital number, since it uses as much as digits as its factorization.
10288556438081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14745600, while the sum is 59.
The spelling of 10288556438081 in words is "ten trillion, two hundred eighty-eight billion, five hundred fifty-six million, four hundred thirty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •