Base | Representation |
---|---|
bin | 101010100000101… |
… | …1000011110000101 |
3 | 10200102001221020201 |
4 | 1111001120132011 |
5 | 10410131110413 |
6 | 353313130501 |
7 | 50230263415 |
oct | 12501303605 |
9 | 3612057221 |
10 | 1426425733 |
11 | 6721a8847 |
12 | 339859a31 |
13 | 1996a18c5 |
14 | d7630645 |
15 | 853649dd |
hex | 55058785 |
1426425733 has 2 divisors, whose sum is σ = 1426425734. Its totient is φ = 1426425732.
The previous prime is 1426425731. The next prime is 1426425757. The reversal of 1426425733 is 3375246241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1174981284 + 251444449 = 34278^2 + 15857^2 .
It is a cyclic number.
It is not a de Polignac number, because 1426425733 - 21 = 1426425731 is a prime.
Together with 1426425731, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1426425692 and 1426425701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1426425731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 713212866 + 713212867.
It is an arithmetic number, because the mean of its divisors is an integer number (713212867).
Almost surely, 21426425733 is an apocalyptic number.
It is an amenable number.
1426425733 is a deficient number, since it is larger than the sum of its proper divisors (1).
1426425733 is an equidigital number, since it uses as much as digits as its factorization.
1426425733 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 120960, while the sum is 37.
The square root of 1426425733 is about 37768.0517501234. The cubic root of 1426425733 is about 1125.6837280452.
The spelling of 1426425733 in words is "one billion, four hundred twenty-six million, four hundred twenty-five thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •