Base | Representation |
---|---|
bin | 1111111010101101… |
… | …0100011110001010 |
3 | 102000202222011001020 |
4 | 3332223110132022 |
5 | 32222312101111 |
6 | 1543552133310 |
7 | 210611636130 |
oct | 37653243612 |
9 | 12022864036 |
10 | 4272768906 |
11 | 18a295957a |
12 | 9b2b37236 |
13 | 5312a6933 |
14 | 2c7679750 |
15 | 1a01a5906 |
hex | fead478a |
4272768906 has 64 divisors (see below), whose sum is σ = 10298449920. Its totient is φ = 1154502720.
The previous prime is 4272768889. The next prime is 4272768923. The reversal of 4272768906 is 6098672724.
It is an interprime number because it is at equal distance from previous prime (4272768889) and next prime (4272768923).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 479976 + ... + 488796.
It is an arithmetic number, because the mean of its divisors is an integer number (160913280).
Almost surely, 24272768906 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4272768906, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5149224960).
4272768906 is an abundant number, since it is smaller than the sum of its proper divisors (6025681014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4272768906 is a wasteful number, since it uses less digits than its factorization.
4272768906 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9459.
The product of its (nonzero) digits is 2032128, while the sum is 51.
The square root of 4272768906 is about 65366.4203242001. The cubic root of 4272768906 is about 1622.6933940729.
The spelling of 4272768906 in words is "four billion, two hundred seventy-two million, seven hundred sixty-eight thousand, nine hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •