Base | Representation |
---|---|
bin | 101010011110011… |
… | …1001110001101010 |
3 | 10200022212021102011 |
4 | 1110330321301222 |
5 | 10404331021214 |
6 | 353232030134 |
7 | 50214302665 |
oct | 12474716152 |
9 | 3608767364 |
10 | 1425251434 |
11 | 671576552 |
12 | 33939234a |
13 | 199380259 |
14 | d74066dc |
15 | 851d1ac4 |
hex | 54f39c6a |
1425251434 has 8 divisors (see below), whose sum is σ = 2138058468. Its totient is φ = 712565280.
The previous prime is 1425251431. The next prime is 1425251437. The reversal of 1425251434 is 4341525241.
It is an interprime number because it is at equal distance from previous prime (1425251431) and next prime (1425251437).
It can be written as a sum of positive squares in 2 ways, for example, as 1417146025 + 8105409 = 37645^2 + 2847^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1425251396 and 1425251405.
It is not an unprimeable number, because it can be changed into a prime (1425251431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9924 + ... + 54304.
Almost surely, 21425251434 is an apocalyptic number.
1425251434 is a deficient number, since it is larger than the sum of its proper divisors (712807034).
1425251434 is a wasteful number, since it uses less digits than its factorization.
1425251434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60440.
The product of its digits is 19200, while the sum is 31.
The square root of 1425251434 is about 37752.5023541487. The cubic root of 1425251434 is about 1125.3747384362.
Adding to 1425251434 its reverse (4341525241), we get a palindrome (5766776675).
The spelling of 1425251434 in words is "one billion, four hundred twenty-five million, two hundred fifty-one thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •