Base | Representation |
---|---|
bin | 100110100100110110100… |
… | …1001111100111110010101 |
3 | 200202211221000111221211011 |
4 | 1031021231021330332111 |
5 | 1143331112132000403 |
6 | 15135342315212221 |
7 | 1055021031444553 |
oct | 115115511747625 |
9 | 20684830457734 |
10 | 5301820968853 |
11 | 176454279a6a2 |
12 | 717641147071 |
13 | 2c5c62245326 |
14 | 14487669cbd3 |
15 | 92da4bcba6d |
hex | 4d26d27cf95 |
5301820968853 has 4 divisors (see below), whose sum is σ = 5580864177760. Its totient is φ = 5022777759948.
The previous prime is 5301820968839. The next prime is 5301820968863. The reversal of 5301820968853 is 3588690281035.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5301820968853 is a prime.
It is a super-2 number, since 2×53018209688532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5301820968833) 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, 139521604425 + ... + 139521604462.
It is an arithmetic number, because the mean of its divisors is an integer number (1395216044440).
Almost surely, 25301820968853 is an apocalyptic number.
It is an amenable number.
5301820968853 is a deficient number, since it is larger than the sum of its proper divisors (279043208907).
5301820968853 is a wasteful number, since it uses less digits than its factorization.
5301820968853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279043208906.
The product of its (nonzero) digits is 12441600, while the sum is 58.
The spelling of 5301820968853 in words is "five trillion, three hundred one billion, eight hundred twenty million, nine hundred sixty-eight thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •