Base | Representation |
---|---|
bin | 1111101110001111… |
… | …0000110011000011 |
3 | 101220010112101102001 |
4 | 3323203300303003 |
5 | 32120414044011 |
6 | 1534443004431 |
7 | 206405166553 |
oct | 37343606303 |
9 | 11803471361 |
10 | 4220456131 |
11 | 1876379181 |
12 | 999509717 |
13 | 5234bb928 |
14 | 2c073d163 |
15 | 19a7c07c1 |
hex | fb8f0cc3 |
4220456131 has 4 divisors (see below), whose sum is σ = 4221710752. Its totient is φ = 4219201512.
The previous prime is 4220456089. The next prime is 4220456153. The reversal of 4220456131 is 1316540224.
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 4220456131 - 211 = 4220454083 is a prime.
It is a super-2 number, since 2×42204561312 = 35624499907390978322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4220456131.
It is not an unprimeable number, because it can be changed into a prime (4220453131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 622251 + ... + 628996.
It is an arithmetic number, because the mean of its divisors is an integer number (1055427688).
Almost surely, 24220456131 is an apocalyptic number.
4220456131 is a deficient number, since it is larger than the sum of its proper divisors (1254621).
4220456131 is a wasteful number, since it uses less digits than its factorization.
4220456131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1254620.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 4220456131 is about 64965.0377587822. The cubic root of 4220456131 is about 1616.0438102595.
Adding to 4220456131 its reverse (1316540224), we get a palindrome (5536996355).
The spelling of 4220456131 in words is "four billion, two hundred twenty million, four hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •