Base | Representation |
---|---|
bin | 100100101101111101101… |
… | …0001111011010001000001 |
3 | 122212102220202222010020001 |
4 | 1021123323101323101001 |
5 | 1130140221342322141 |
6 | 14422200011120001 |
7 | 1030412105006431 |
oct | 111337321732101 |
9 | 18772822863201 |
10 | 5046507385921 |
11 | 16762369479a1 |
12 | 696069143001 |
13 | 2a7b64382431 |
14 | 1363762bc2c1 |
15 | 8b410667a31 |
hex | 496fb47b441 |
5046507385921 has 4 divisors (see below), whose sum is σ = 5046528962772. Its totient is φ = 5046485809072.
The previous prime is 5046507385901. The next prime is 5046507385937. The reversal of 5046507385921 is 1295837056405.
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 4099972975921 + 946534410000 = 2024839^2 + 972900^2 .
It is a cyclic number.
It is not a de Polignac number, because 5046507385921 - 213 = 5046507377729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5046507385901) 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, 10433710 + ... + 10906663.
It is an arithmetic number, because the mean of its divisors is an integer number (1261632240693).
It is a 1-persistent number, because it is pandigital, but 2⋅5046507385921 = 10093014771842 is not.
Almost surely, 25046507385921 is an apocalyptic number.
It is an amenable number.
5046507385921 is a deficient number, since it is larger than the sum of its proper divisors (21576851).
5046507385921 is a wasteful number, since it uses less digits than its factorization.
5046507385921 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21576850.
The product of its (nonzero) digits is 9072000, while the sum is 55.
The spelling of 5046507385921 in words is "five trillion, forty-six billion, five hundred seven million, three hundred eighty-five thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •