Base | Representation |
---|---|
bin | 111111011010110101… |
… | …101000000010011001 |
3 | 20111202201122020002202 |
4 | 333122311220002121 |
5 | 2103430034001103 |
6 | 51141033335545 |
7 | 4630324310456 |
oct | 773265500231 |
9 | 214681566082 |
10 | 68096000153 |
11 | 26974464885 |
12 | 112452675b5 |
13 | 6562b4331c |
14 | 341dbca82d |
15 | 1b883b2988 |
hex | fdad68099 |
68096000153 has 2 divisors, whose sum is σ = 68096000154. Its totient is φ = 68096000152.
The previous prime is 68096000129. The next prime is 68096000191. The reversal of 68096000153 is 35100069086.
It is an a-pointer prime, because the next prime (68096000191) can be obtained adding 68096000153 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 55221240064 + 12874760089 = 234992^2 + 113467^2 .
It is a cyclic number.
It is not a de Polignac number, because 68096000153 - 212 = 68095996057 is a prime.
It is a super-3 number, since 3×680960001533 (a number of 33 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (68096002153) 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, 34048000076 + 34048000077.
It is an arithmetic number, because the mean of its divisors is an integer number (34048000077).
Almost surely, 268096000153 is an apocalyptic number.
It is an amenable number.
68096000153 is a deficient number, since it is larger than the sum of its proper divisors (1).
68096000153 is an equidigital number, since it uses as much as digits as its factorization.
68096000153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 38.
The spelling of 68096000153 in words is "sixty-eight billion, ninety-six million, one hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •