Base | Representation |
---|---|
bin | 1001010010000101001110… |
… | …0110111100011001001001 |
3 | 1100010201002202121110201222 |
4 | 2110201103212330121021 |
5 | 2314204342210404230 |
6 | 33412403443251425 |
7 | 2102243160131423 |
oct | 224412346743111 |
9 | 40121082543658 |
10 | 10206245013065 |
11 | 3285498262a42 |
12 | 118a056979b75 |
13 | 5905a222acaa |
14 | 273db079b813 |
15 | 12a74b79b6e5 |
hex | 948539bc649 |
10206245013065 has 4 divisors (see below), whose sum is σ = 12247494015684. Its totient is φ = 8164996010448.
The previous prime is 10206245013001. The next prime is 10206245013067. The reversal of 10206245013065 is 56031054260201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4335044633929 + 5871200379136 = 2082077^2 + 2423056^2 .
It is a cyclic number.
It is not a de Polignac number, because 10206245013065 - 26 = 10206245013001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10206245013067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1020624501302 + ... + 1020624501311.
It is an arithmetic number, because the mean of its divisors is an integer number (3061873503921).
Almost surely, 210206245013065 is an apocalyptic number.
It is an amenable number.
10206245013065 is a deficient number, since it is larger than the sum of its proper divisors (2041249002619).
10206245013065 is an equidigital number, since it uses as much as digits as its factorization.
10206245013065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2041249002618.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 10206245013065 its reverse (56031054260201), we get a palindrome (66237299273266).
The spelling of 10206245013065 in words is "ten trillion, two hundred six billion, two hundred forty-five million, thirteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •