Base | Representation |
---|---|
bin | 1011110101110111011000… |
… | …0000000100010111101011 |
3 | 1201002200221222012121000100 |
4 | 2331131312000010113223 |
5 | 3201310003023303223 |
6 | 43405152302440443 |
7 | 2512444241413266 |
oct | 275356600042753 |
9 | 51080858177010 |
10 | 13020025603563 |
11 | 416a842027090 |
12 | 1563450293123 |
13 | 735a24758b94 |
14 | 33025b893cdd |
15 | 178a327ae043 |
hex | bd7760045eb |
13020025603563 has 12 divisors (see below), whose sum is σ = 20516403981528. Its totient is φ = 7890924608160.
The previous prime is 13020025603553. The next prime is 13020025603579. The reversal of 13020025603563 is 36530652002031.
13020025603563 is a `hidden beast` number, since 1 + 3 + 0 + 2 + 0 + 0 + 2 + 560 + 35 + 63 = 666.
It is not a de Polignac number, because 13020025603563 - 210 = 13020025602539 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13020025603553) 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 11 ways as a sum of consecutive naturals, for example, 65757704970 + ... + 65757705167.
It is an arithmetic number, because the mean of its divisors is an integer number (1709700331794).
Almost surely, 213020025603563 is an apocalyptic number.
13020025603563 is a deficient number, since it is larger than the sum of its proper divisors (7496378377965).
13020025603563 is a wasteful number, since it uses less digits than its factorization.
13020025603563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131515410154 (or 131515410151 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 36.
Adding to 13020025603563 its reverse (36530652002031), we get a palindrome (49550677605594).
The spelling of 13020025603563 in words is "thirteen trillion, twenty billion, twenty-five million, six hundred three thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •