Base | Representation |
---|---|
bin | 100110100110000101000… |
… | …1100000011111000011111 |
3 | 200210002201121221020222110 |
4 | 1031030022030003320133 |
5 | 1143402011104404401 |
6 | 15140455551245103 |
7 | 1055143232121645 |
oct | 115141214037037 |
9 | 20702647836873 |
10 | 5304455544351 |
11 | 1765674960217 |
12 | 718057519793 |
13 | 2c6292002a42 |
14 | 144a46541195 |
15 | 92eab13b9d6 |
hex | 4d30a303e1f |
5304455544351 has 4 divisors (see below), whose sum is σ = 7072607392472. Its totient is φ = 3536303696232.
The previous prime is 5304455544347. The next prime is 5304455544397. The reversal of 5304455544351 is 1534455544035.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5304455544351 - 22 = 5304455544347 is a prime.
It is a super-2 number, since 2×53044555443512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5304455544351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5304455544331) 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, 884075924056 + ... + 884075924061.
It is an arithmetic number, because the mean of its divisors is an integer number (1768151848118).
Almost surely, 25304455544351 is an apocalyptic number.
5304455544351 is a deficient number, since it is larger than the sum of its proper divisors (1768151848121).
5304455544351 is a wasteful number, since it uses less digits than its factorization.
5304455544351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1768151848120.
The product of its (nonzero) digits is 7200000, while the sum is 48.
The spelling of 5304455544351 in words is "five trillion, three hundred four billion, four hundred fifty-five million, five hundred forty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •