Base | Representation |
---|---|
bin | 1100001100010011011000… |
… | …0100010001011100010111 |
3 | 1202110112221100022220000101 |
4 | 3003010312010101130113 |
5 | 3224113431001124003 |
6 | 44302222433154531 |
7 | 2552341534040533 |
oct | 303046604213427 |
9 | 52415840286011 |
10 | 13405500020503 |
11 | 42a927130a988 |
12 | 16060aa9bba47 |
13 | 763196916856 |
14 | 344b88848bc3 |
15 | 183a93d5611d |
hex | c3136111717 |
13405500020503 has 8 divisors (see below), whose sum is σ = 13711579654608. Its totient is φ = 13101388744704.
The previous prime is 13405500020501. The next prime is 13405500020557. The reversal of 13405500020503 is 30502000550431.
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 13405500020503 - 21 = 13405500020501 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 (13405500020501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 492075801 + ... + 492103042.
It is an arithmetic number, because the mean of its divisors is an integer number (1713947456826).
Almost surely, 213405500020503 is an apocalyptic number.
13405500020503 is a deficient number, since it is larger than the sum of its proper divisors (306079634105).
13405500020503 is an equidigital number, since it uses as much as digits as its factorization.
13405500020503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984179153.
The product of its (nonzero) digits is 9000, while the sum is 28.
Adding to 13405500020503 its reverse (30502000550431), we get a palindrome (43907500570934).
The spelling of 13405500020503 in words is "thirteen trillion, four hundred five billion, five hundred million, twenty thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •