Base | Representation |
---|---|
bin | 100110110111000001110… |
… | …1011110011100010001011 |
3 | 200220120200021101110212211 |
4 | 1031232003223303202023 |
5 | 1200001032013204444 |
6 | 15205315421045551 |
7 | 1060602221650516 |
oct | 115560353634213 |
9 | 20816607343784 |
10 | 5340853647499 |
11 | 177a0527148a7 |
12 | 7231150b68b7 |
13 | 2c9842a8c996 |
14 | 1466da5c7d7d |
15 | 93ddb7d9c34 |
hex | 4db83af388b |
5340853647499 has 4 divisors (see below), whose sum is σ = 5340860532936. Its totient is φ = 5340846762064.
The previous prime is 5340853647491. The next prime is 5340853647529. The reversal of 5340853647499 is 9947463580435.
5340853647499 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5340853647499 - 23 = 5340853647491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5340853647491) 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, 2106274 + ... + 3888199.
It is an arithmetic number, because the mean of its divisors is an integer number (1335215133234).
Almost surely, 25340853647499 is an apocalyptic number.
5340853647499 is a deficient number, since it is larger than the sum of its proper divisors (6885437).
5340853647499 is an equidigital number, since it uses as much as digits as its factorization.
5340853647499 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6885436.
The product of its (nonzero) digits is 391910400, while the sum is 67.
The spelling of 5340853647499 in words is "five trillion, three hundred forty billion, eight hundred fifty-three million, six hundred forty-seven thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •