Base | Representation |
---|---|
bin | 1111101111101000… |
… | …0110011110000000 |
3 | 101220112112220020110 |
4 | 3323322012132000 |
5 | 32123413441224 |
6 | 1535212311320 |
7 | 206506026342 |
oct | 37372063600 |
9 | 11815486213 |
10 | 4226312064 |
11 | 1879708897 |
12 | 99b472540 |
13 | 52478c190 |
14 | 2c1425292 |
15 | 19b07a929 |
hex | fbe86780 |
4226312064 has 128 divisors (see below), whose sum is σ = 12801106080. Its totient is φ = 1223884800.
The previous prime is 4226312033. The next prime is 4226312107. The reversal of 4226312064 is 4602136224.
It is a tau number, because it is divible by the number of its divisors (128).
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 15 ways as a sum of consecutive naturals, for example, 59964 + ... + 109764.
Almost surely, 24226312064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4226312064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6400553040).
4226312064 is an abundant number, since it is smaller than the sum of its proper divisors (8574794016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4226312064 is a wasteful number, since it uses less digits than its factorization.
4226312064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49848 (or 49836 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
The square root of 4226312064 is about 65010.0920165477. The cubic root of 4226312064 is about 1616.7908914970.
Adding to 4226312064 its reverse (4602136224), we get a palindrome (8828448288).
The spelling of 4226312064 in words is "four billion, two hundred twenty-six million, three hundred twelve thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •