Base | Representation |
---|---|
bin | 111101111010011011111… |
… | …111000100100001100101 |
3 | 120001201221210122220111211 |
4 | 331322123333010201211 |
5 | 1024201442431001000 |
6 | 13014315133431421 |
7 | 616246545416353 |
oct | 75723377044145 |
9 | 16051853586454 |
10 | 4254634625125 |
11 | 13a0420367315 |
12 | 5886b063b571 |
13 | 24b297108b51 |
14 | 109cd54a27d3 |
15 | 75a15b067ba |
hex | 3de9bfc4865 |
4254634625125 has 8 divisors (see below), whose sum is σ = 5309784012312. Its totient is φ = 3403707700000.
The previous prime is 4254634625123. The next prime is 4254634625183. The reversal of 4254634625125 is 5215264364524.
It can be written as a sum of positive squares in 4 ways, for example, as 119992267201 + 4134642357924 = 346399^2 + 2033382^2 .
It is not a de Polignac number, because 4254634625125 - 21 = 4254634625123 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 (4254634625123) 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, 17018538376 + ... + 17018538625.
It is an arithmetic number, because the mean of its divisors is an integer number (663723001539).
Almost surely, 24254634625125 is an apocalyptic number.
It is an amenable number.
4254634625125 is a deficient number, since it is larger than the sum of its proper divisors (1055149387187).
4254634625125 is an equidigital number, since it uses as much as digits as its factorization.
4254634625125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34037077016 (or 34037077006 counting only the distinct ones).
The product of its digits is 6912000, while the sum is 49.
Adding to 4254634625125 its reverse (5215264364524), we get a palindrome (9469898989649).
The spelling of 4254634625125 in words is "four trillion, two hundred fifty-four billion, six hundred thirty-four million, six hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •