Base | Representation |
---|---|
bin | 100110100110010110111… |
… | …1001000011100111101001 |
3 | 200210011021101001111201011 |
4 | 1031030231321003213221 |
5 | 1143404222430323223 |
6 | 15141035230023521 |
7 | 1055164124405461 |
oct | 115145571034751 |
9 | 20704241044634 |
10 | 5305054542313 |
11 | 1765951a94259 |
12 | 7181a4047ba1 |
13 | 2c635913a4c6 |
14 | 144aa1d06ba1 |
15 | 92ee3a0c80d |
hex | 4d32de439e9 |
5305054542313 has 4 divisors (see below), whose sum is σ = 5306948531028. Its totient is φ = 5303160553600.
The previous prime is 5305054542289. The next prime is 5305054542341. The reversal of 5305054542313 is 3132454505035.
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 3281938038544 + 2023116503769 = 1811612^2 + 1422363^2 .
It is a cyclic number.
It is not a de Polignac number, because 5305054542313 - 213 = 5305054534121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5305054542013) 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 3 ways as a sum of consecutive naturals, for example, 946990156 + ... + 946995757.
It is an arithmetic number, because the mean of its divisors is an integer number (1326737132757).
Almost surely, 25305054542313 is an apocalyptic number.
It is an amenable number.
5305054542313 is a deficient number, since it is larger than the sum of its proper divisors (1893988715).
5305054542313 is a wasteful number, since it uses less digits than its factorization.
5305054542313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1893988714.
The product of its (nonzero) digits is 540000, while the sum is 40.
The spelling of 5305054542313 in words is "five trillion, three hundred five billion, fifty-four million, five hundred forty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.223 sec. • engine limits •