Base | Representation |
---|---|
bin | 1111101110010110… |
… | …1111111010101011 |
3 | 101220011111211122111 |
4 | 3323211233322223 |
5 | 32121032224221 |
6 | 1534502103151 |
7 | 206412465562 |
oct | 37345577253 |
9 | 11804454574 |
10 | 4220976811 |
11 | 18766a4397 |
12 | 99971aab7 |
13 | 52364191c |
14 | 2c0836bd9 |
15 | 19a874be1 |
hex | fb96feab |
4220976811 has 4 divisors (see below), whose sum is σ = 4225324824. Its totient is φ = 4216628800.
The previous prime is 4220976797. The next prime is 4220976821. The reversal of 4220976811 is 1186790224.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4220976811 - 29 = 4220976299 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4220976821) 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 3 ways as a sum of consecutive naturals, for example, 2172550 + ... + 2174491.
It is an arithmetic number, because the mean of its divisors is an integer number (1056331206).
Almost surely, 24220976811 is an apocalyptic number.
4220976811 is a deficient number, since it is larger than the sum of its proper divisors (4348013).
4220976811 is an equidigital number, since it uses as much as digits as its factorization.
4220976811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4348012.
The product of its (nonzero) digits is 48384, while the sum is 40.
The square root of 4220976811 is about 64969.0450214562. The cubic root of 4220976811 is about 1616.1102649320.
The spelling of 4220976811 in words is "four billion, two hundred twenty million, nine hundred seventy-six thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •