Base | Representation |
---|---|
bin | 100100000000110100100… |
… | …0010110001011100100111 |
3 | 122112011200200010100212221 |
4 | 1020001221002301130213 |
5 | 1122043202023100440 |
6 | 14305444300053211 |
7 | 1020410553304111 |
oct | 110015102613447 |
9 | 18464620110787 |
10 | 4949564659495 |
11 | 163910a240775 |
12 | 67b313234207 |
13 | 29b98508b211 |
14 | 1317bb2d23b1 |
15 | 88b39a36d4a |
hex | 480690b1727 |
4949564659495 has 8 divisors (see below), whose sum is σ = 5964122728080. Its totient is φ = 3943221636480.
The previous prime is 4949564659469. The next prime is 4949564659553. The reversal of 4949564659495 is 5949564659494.
4949564659495 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4949564659495 - 225 = 4949531105063 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2053760065 + ... + 2053762474.
It is an arithmetic number, because the mean of its divisors is an integer number (745515341010).
Almost surely, 24949564659495 is an apocalyptic number.
4949564659495 is a deficient number, since it is larger than the sum of its proper divisors (1014558068585).
4949564659495 is a wasteful number, since it uses less digits than its factorization.
4949564659495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4107522785.
The product of its digits is 7558272000, while the sum is 79.
Subtracting 4949564659495 from its reverse (5949564659494), we obtain a palindrome (999999999999).
The spelling of 4949564659495 in words is "four trillion, nine hundred forty-nine billion, five hundred sixty-four million, six hundred fifty-nine thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •