Base | Representation |
---|---|
bin | 10010111111011110… |
… | …10001000010010101 |
3 | 222022120212121222001 |
4 | 21133233101002111 |
5 | 131340204120121 |
6 | 4403431035301 |
7 | 510445635631 |
oct | 113757210225 |
9 | 28276777861 |
10 | 10196160661 |
11 | 4362515465 |
12 | 1b8680bb31 |
13 | c6652c07b |
14 | 6ca225dc1 |
15 | 3ea209991 |
hex | 25fbd1095 |
10196160661 has 2 divisors, whose sum is σ = 10196160662. Its totient is φ = 10196160660.
The previous prime is 10196160643. The next prime is 10196160691. The reversal of 10196160661 is 16606169101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9627338161 + 568822500 = 98119^2 + 23850^2 .
It is an emirp because it is prime and its reverse (16606169101) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 19909196101 and 10169190991.
It is a cyclic number.
It is not a de Polignac number, because 10196160661 - 213 = 10196152469 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10196160661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10196160691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5098080330 + 5098080331.
It is an arithmetic number, because the mean of its divisors is an integer number (5098080331).
Almost surely, 210196160661 is an apocalyptic number.
It is an amenable number.
10196160661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10196160661 is an equidigital number, since it uses as much as digits as its factorization.
10196160661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 10196160661 in words is "ten billion, one hundred ninety-six million, one hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •