Base | Representation |
---|---|
bin | 100100000001010110101… |
… | …1111001010001101101111 |
3 | 122112021122200211122121111 |
4 | 1020002231133022031233 |
5 | 1122103030003423123 |
6 | 14310154240012451 |
7 | 1020451165522513 |
oct | 110025537121557 |
9 | 18467580748544 |
10 | 4950712951663 |
11 | 163964943a666 |
12 | 67b593901127 |
13 | 29bb08c49b3b |
14 | 131889a02143 |
15 | 88ba575b90d |
hex | 480ad7ca36f |
4950712951663 has 8 divisors (see below), whose sum is σ = 5065907373648. Its totient is φ = 4835521328064.
The previous prime is 4950712951643. The next prime is 4950712951673. The reversal of 4950712951663 is 3661592170594.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4950712951663 - 221 = 4950710854511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4950712951598 and 4950712951607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4950712951643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3119595 + ... + 4430947.
It is an arithmetic number, because the mean of its divisors is an integer number (633238421706).
Almost surely, 24950712951663 is an apocalyptic number.
4950712951663 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4950712951663 is a deficient number, since it is larger than the sum of its proper divisors (115194421985).
4950712951663 is a wasteful number, since it uses less digits than its factorization.
4950712951663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1399193.
The product of its (nonzero) digits is 12247200, while the sum is 58.
The spelling of 4950712951663 in words is "four trillion, nine hundred fifty billion, seven hundred twelve million, nine hundred fifty-one thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •