Base | Representation |
---|---|
bin | 1001000011000011… |
… | …00010010000111001 |
3 | 110112112001211002020 |
4 | 10201201202100321 |
5 | 34421444002041 |
6 | 2121555025053 |
7 | 231241163022 |
oct | 44141422071 |
9 | 13475054066 |
10 | 4857406521 |
11 | 2072974460 |
12 | b3689b189 |
13 | 5c5453c56 |
14 | 341183c49 |
15 | 1d668b866 |
hex | 121862439 |
4857406521 has 8 divisors (see below), whose sum is σ = 7065318624. Its totient is φ = 2943882720.
The previous prime is 4857406507. The next prime is 4857406531. The reversal of 4857406521 is 1256047584.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4857406521 - 214 = 4857390137 is a prime.
It is a super-2 number, since 2×48574065212 = 47188796220506646882, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (4857406531) 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, 73597036 + ... + 73597101.
It is an arithmetic number, because the mean of its divisors is an integer number (883164828).
Almost surely, 24857406521 is an apocalyptic number.
It is an amenable number.
4857406521 is a deficient number, since it is larger than the sum of its proper divisors (2207912103).
4857406521 is a wasteful number, since it uses less digits than its factorization.
4857406521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147194151.
The product of its (nonzero) digits is 268800, while the sum is 42.
The square root of 4857406521 is about 69695.0968217995. The cubic root of 4857406521 is about 1693.5634950189.
The spelling of 4857406521 in words is "four billion, eight hundred fifty-seven million, four hundred six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •