Base | Representation |
---|---|
bin | 1011001110010011… |
… | …11100000010010001 |
3 | 120112221021111120220 |
4 | 11213021330002101 |
5 | 44320030010440 |
6 | 2433530023253 |
7 | 302214654666 |
oct | 54711740221 |
9 | 16487244526 |
10 | 6025625745 |
11 | 2612343897 |
12 | 1201b77b29 |
13 | 75049ba29 |
14 | 41239da6d |
15 | 253eea8d0 |
hex | 16727c091 |
6025625745 has 8 divisors (see below), whose sum is σ = 9641001216. Its totient is φ = 3213667056.
The previous prime is 6025625719. The next prime is 6025625747. The reversal of 6025625745 is 5475265206.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6025625745 - 26 = 6025625681 is a prime.
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 a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6025625697 and 6025625706.
It is not an unprimeable number, because it can be changed into a prime (6025625747) 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, 200854177 + ... + 200854206.
It is an arithmetic number, because the mean of its divisors is an integer number (1205125152).
Almost surely, 26025625745 is an apocalyptic number.
It is an amenable number.
6025625745 is a deficient number, since it is larger than the sum of its proper divisors (3615375471).
6025625745 is a wasteful number, since it uses less digits than its factorization.
6025625745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401708391.
The product of its (nonzero) digits is 504000, while the sum is 42.
The square root of 6025625745 is about 77624.9041545302. The cubic root of 6025625745 is about 1819.7038669054.
The spelling of 6025625745 in words is "six billion, twenty-five million, six hundred twenty-five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •