Base | Representation |
---|---|
bin | 10010110000011011… |
… | …01011110010111101 |
3 | 221222210022210000202 |
4 | 21120031223302331 |
5 | 131110344314421 |
6 | 4343121133245 |
7 | 504353611124 |
oct | 113015536275 |
9 | 27883283022 |
10 | 10069916861 |
11 | 42a8229644 |
12 | 1b5048a225 |
13 | c4632a1b4 |
14 | 6b7562abb |
15 | 3de0be10b |
hex | 25836bcbd |
10069916861 has 2 divisors, whose sum is σ = 10069916862. Its totient is φ = 10069916860.
The previous prime is 10069916851. The next prime is 10069916869. The reversal of 10069916861 is 16861996001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9181280761 + 888636100 = 95819^2 + 29810^2 .
It is an emirp because it is prime and its reverse (16861996001) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 19891669001 and 10096619891.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10069916861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10069916869) 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, 5034958430 + 5034958431.
It is an arithmetic number, because the mean of its divisors is an integer number (5034958431).
Almost surely, 210069916861 is an apocalyptic number.
It is an amenable number.
10069916861 is a deficient number, since it is larger than the sum of its proper divisors (1).
10069916861 is an equidigital number, since it uses as much as digits as its factorization.
10069916861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 47.
The spelling of 10069916861 in words is "ten billion, sixty-nine million, nine hundred sixteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •