Base | Representation |
---|---|
bin | 1000000011011010… |
… | …11111000001100000 |
3 | 102011022202002120020 |
4 | 10001231133001200 |
5 | 32323324334224 |
6 | 1553011113440 |
7 | 212100400152 |
oct | 40155370140 |
9 | 12138662506 |
10 | 4323668064 |
11 | 19196638a1 |
12 | a07ba2880 |
13 | 53b9b8391 |
14 | 2d0328ad2 |
15 | 1a48abc79 |
hex | 101b5f060 |
4323668064 has 48 divisors (see below), whose sum is σ = 11843096832. Its totient is φ = 1378560128.
The previous prime is 4323668047. The next prime is 4323668081. The reversal of 4323668064 is 4608663234.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (4323668047) and next prime (4323668081).
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 976884 + ... + 981299.
It is an arithmetic number, because the mean of its divisors is an integer number (246731184).
Almost surely, 24323668064 is an apocalyptic number.
It is an amenable number.
4323668064 is an abundant number, since it is smaller than the sum of its proper divisors (7519428768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4323668064 is a wasteful number, since it uses less digits than its factorization.
4323668064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958219 (or 1958211 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 42.
The square root of 4323668064 is about 65754.6048881749. The cubic root of 4323668064 is about 1629.1113959218. Note that the first 3 decimals are identical.
The spelling of 4323668064 in words is "four billion, three hundred twenty-three million, six hundred sixty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •