Base | Representation |
---|---|
bin | 1100000001110000… |
… | …11010110100010101 |
3 | 121200000102211012122 |
4 | 12000320122310111 |
5 | 101211023201403 |
6 | 2544425025325 |
7 | 316005433040 |
oct | 60070326425 |
9 | 17600384178 |
10 | 6457240853 |
11 | 2813a42698 |
12 | 1302625245 |
13 | 7bba2c49b |
14 | 453833c57 |
15 | 27bd56838 |
hex | 180e1ad15 |
6457240853 has 4 divisors (see below), whose sum is σ = 7379703840. Its totient is φ = 5534777868.
The previous prime is 6457240831. The next prime is 6457240861. The reversal of 6457240853 is 3580427546.
6457240853 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6457240853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6457240873) 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, 461231483 + ... + 461231496.
It is an arithmetic number, because the mean of its divisors is an integer number (1844925960).
Almost surely, 26457240853 is an apocalyptic number.
It is an amenable number.
6457240853 is a deficient number, since it is larger than the sum of its proper divisors (922462987).
6457240853 is an equidigital number, since it uses as much as digits as its factorization.
6457240853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 922462986.
The product of its (nonzero) digits is 806400, while the sum is 44.
The square root of 6457240853 is about 80356.9589581388. The cubic root of 6457240853 is about 1862.1542901310.
The spelling of 6457240853 in words is "six billion, four hundred fifty-seven million, two hundred forty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •