Base | Representation |
---|---|
bin | 1111101111011011… |
… | …0110110100011011 |
3 | 101220110221200112020 |
4 | 3323312312310123 |
5 | 32123204232111 |
6 | 1535142145523 |
7 | 206465554554 |
oct | 37366666433 |
9 | 11813850466 |
10 | 4225461531 |
11 | 1879187875 |
12 | 99b1222a3 |
13 | 524551cc5 |
14 | 2c128332b |
15 | 19ae5d906 |
hex | fbdb6d1b |
4225461531 has 8 divisors (see below), whose sum is σ = 5786217744. Its totient is φ = 2740839840.
The previous prime is 4225461529. The next prime is 4225461557. The reversal of 4225461531 is 1351645224.
4225461531 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4225461531 - 21 = 4225461529 is a prime.
It is a super-2 number, since 2×42254615312 = 35709050299921727922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4225461492 and 4225461501.
It is not an unprimeable number, because it can be changed into a prime (4225461631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19033500 + ... + 19033721.
It is an arithmetic number, because the mean of its divisors is an integer number (723277218).
Almost surely, 24225461531 is an apocalyptic number.
4225461531 is a deficient number, since it is larger than the sum of its proper divisors (1560756213).
4225461531 is a wasteful number, since it uses less digits than its factorization.
4225461531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38067261.
The product of its digits is 28800, while the sum is 33.
The square root of 4225461531 is about 65003.5501415115. The cubic root of 4225461531 is about 1616.6824260671.
The spelling of 4225461531 in words is "four billion, two hundred twenty-five million, four hundred sixty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •