Base | Representation |
---|---|
bin | 1001010010000111100110… |
… | …1111010100111001011101 |
3 | 1100010202202100101012200211 |
4 | 2110201321233110321131 |
5 | 2314212144443313142 |
6 | 33412551135052421 |
7 | 2102265055560466 |
oct | 224417157247135 |
9 | 40122670335624 |
10 | 10206884744797 |
11 | 3285796388954 |
12 | 118a1b5071111 |
13 | 590674928290 |
14 | 274031727d6d |
15 | 12a787a16917 |
hex | 94879bd4e5d |
10206884744797 has 8 divisors (see below), whose sum is σ = 11008862857944. Its totient is φ = 9407311364928.
The previous prime is 10206884744789. The next prime is 10206884744821. The reversal of 10206884744797 is 79744748860201.
It can be written as a sum of positive squares in 4 ways, for example, as 261761163876 + 9945123580921 = 511626^2 + 3153589^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10206884744797 - 23 = 10206884744789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206884744747) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 601174498 + ... + 601191475.
It is an arithmetic number, because the mean of its divisors is an integer number (1376107857243).
Almost surely, 210206884744797 is an apocalyptic number.
It is an amenable number.
10206884744797 is a deficient number, since it is larger than the sum of its proper divisors (801978113147).
10206884744797 is a wasteful number, since it uses less digits than its factorization.
10206884744797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1202366639.
The product of its (nonzero) digits is 151732224, while the sum is 67.
The spelling of 10206884744797 in words is "ten trillion, two hundred six billion, eight hundred eighty-four million, seven hundred forty-four thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •