Base | Representation |
---|---|
bin | 1001000110100110111111… |
… | …1000111110101110110111 |
3 | 1022102212100221110121102102 |
4 | 2101221233320332232313 |
5 | 2302442220124221141 |
6 | 33142050202532315 |
7 | 2052065043543044 |
oct | 221515770765667 |
9 | 38385327417372 |
10 | 10009151007671 |
11 | 3209947895582 |
12 | 1157a1050709b |
13 | 577b21c9b26a |
14 | 2686346121cb |
15 | 1255634ec99b |
hex | 91a6fe3ebb7 |
10009151007671 has 2 divisors, whose sum is σ = 10009151007672. Its totient is φ = 10009151007670.
The previous prime is 10009151007623. The next prime is 10009151007749. The reversal of 10009151007671 is 17670015190001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10009151007671 is a prime.
It is a super-2 number, since 2×100091510076712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10009151007601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5004575503835 + 5004575503836.
It is an arithmetic number, because the mean of its divisors is an integer number (5004575503836).
Almost surely, 210009151007671 is an apocalyptic number.
10009151007671 is a deficient number, since it is larger than the sum of its proper divisors (1).
10009151007671 is an equidigital number, since it uses as much as digits as its factorization.
10009151007671 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13230, while the sum is 38.
Adding to 10009151007671 its reverse (17670015190001), we get a palindrome (27679166197672).
The spelling of 10009151007671 in words is "ten trillion, nine billion, one hundred fifty-one million, seven thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •