Base | Representation |
---|---|
bin | 10011101111110011… |
… | …11011001110010001 |
3 | 1000100211210111021011 |
4 | 21313321323032101 |
5 | 133203002424311 |
6 | 4511553130521 |
7 | 523501116241 |
oct | 116771731621 |
9 | 30324714234 |
10 | 10601608081 |
11 | 4550371079 |
12 | 207a559a41 |
13 | ccc529c9c |
14 | 728007b21 |
15 | 420ae7321 |
hex | 277e7b391 |
10601608081 has 2 divisors, whose sum is σ = 10601608082. Its totient is φ = 10601608080.
The previous prime is 10601608079. The next prime is 10601608093. The reversal of 10601608081 is 18080610601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9098107456 + 1503500625 = 95384^2 + 38775^2 .
It is an emirp because it is prime and its reverse (18080610601) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 18080910901 and 10901908081.
It is a cyclic number.
It is not a de Polignac number, because 10601608081 - 21 = 10601608079 is a prime.
It is a super-2 number, since 2×106016080812 (a number of 21 digits) contains 22 as substring.
Together with 10601608079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10601608681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5300804040 + 5300804041.
It is an arithmetic number, because the mean of its divisors is an integer number (5300804041).
Almost surely, 210601608081 is an apocalyptic number.
It is an amenable number.
10601608081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10601608081 is an equidigital number, since it uses as much as digits as its factorization.
10601608081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 31.
The spelling of 10601608081 in words is "ten billion, six hundred one million, six hundred eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •