Base | Representation |
---|---|
bin | 100001111100001001010… |
… | …1101101111100100010111 |
3 | 121111221021101001000220111 |
4 | 1003320102231233210113 |
5 | 1102411200001332123 |
6 | 13530524313143451 |
7 | 661003223513005 |
oct | 103702255574427 |
9 | 17457241030814 |
10 | 4664648464663 |
11 | 15392a24a6560 |
12 | 6340593bab87 |
13 | 27ab4a26ba15 |
14 | 121aad58ba75 |
15 | 815116e390d |
hex | 43e12b6f917 |
4664648464663 has 8 divisors (see below), whose sum is σ = 5153121434880. Its totient is φ = 4186911164280.
The previous prime is 4664648464573. The next prime is 4664648464673. The reversal of 4664648464663 is 3664648464664.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4664648464663 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4664648464673) 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 7 ways as a sum of consecutive naturals, for example, 2683916545 + ... + 2683918282.
It is an arithmetic number, because the mean of its divisors is an integer number (644140179360).
Almost surely, 24664648464663 is an apocalyptic number.
4664648464663 is a deficient number, since it is larger than the sum of its proper divisors (488472970217).
4664648464663 is a wasteful number, since it uses less digits than its factorization.
4664648464663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5367834917.
The product of its digits is 1146617856, while the sum is 67.
Subtracting from 4664648464663 its reverse (3664648464664), we obtain a palindrome (999999999999).
The spelling of 4664648464663 in words is "four trillion, six hundred sixty-four billion, six hundred forty-eight million, four hundred sixty-four thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •