Base | Representation |
---|---|
bin | 1001000110011011011100… |
… | …1001011011111011000001 |
3 | 1022102120100221021011101201 |
4 | 2101212313021123323001 |
5 | 2302414343143132302 |
6 | 33140414442301201 |
7 | 2051625166510135 |
oct | 221466711337301 |
9 | 38376327234351 |
10 | 10006051536577 |
11 | 32085a7265018 |
12 | 11572a64b7801 |
13 | 577749ac9bb5 |
14 | 26841cb153c5 |
15 | 12543135ac87 |
hex | 919b725bec1 |
10006051536577 has 8 divisors (see below), whose sum is σ = 10014119118080. Its totient is φ = 9997984703520.
The previous prime is 10006051536541. The next prime is 10006051536601. The reversal of 10006051536577 is 77563515060001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10006051536577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10006051531577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28303768 + ... + 28655110.
It is an arithmetic number, because the mean of its divisors is an integer number (1251764889760).
Almost surely, 210006051536577 is an apocalyptic number.
It is an amenable number.
10006051536577 is a deficient number, since it is larger than the sum of its proper divisors (8067581503).
10006051536577 is a wasteful number, since it uses less digits than its factorization.
10006051536577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374223.
The product of its (nonzero) digits is 661500, while the sum is 46.
Adding to 10006051536577 its reverse (77563515060001), we get a palindrome (87569566596578).
The spelling of 10006051536577 in words is "ten trillion, six billion, fifty-one million, five hundred thirty-six thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •