Base | Representation |
---|---|
bin | 11001010111111… |
… | …000101110101111 |
3 | 1002200000101202022 |
4 | 121113320232233 |
5 | 1332434121304 |
6 | 110124020355 |
7 | 13356215531 |
oct | 3127705657 |
9 | 1080011668 |
10 | 425692079 |
11 | 1a932383a |
12 | ba6916bb |
13 | 6a268807 |
14 | 40771851 |
15 | 2758aebe |
hex | 195f8baf |
425692079 has 2 divisors, whose sum is σ = 425692080. Its totient is φ = 425692078.
The previous prime is 425692061. The next prime is 425692097. The reversal of 425692079 is 970296524.
Together with next prime (425692097) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (425692061) and next prime (425692097).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425692079 is a prime.
It is a super-2 number, since 2×4256920792 = 362427492246684482, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425692039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212846039 + 212846040.
It is an arithmetic number, because the mean of its divisors is an integer number (212846040).
Almost surely, 2425692079 is an apocalyptic number.
425692079 is a deficient number, since it is larger than the sum of its proper divisors (1).
425692079 is an equidigital number, since it uses as much as digits as its factorization.
425692079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 44.
The square root of 425692079 is about 20632.3066815129. The cubic root of 425692079 is about 752.2551847993.
The spelling of 425692079 in words is "four hundred twenty-five million, six hundred ninety-two thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •