Base | Representation |
---|---|
bin | 11001011110110… |
… | …110010111010001 |
3 | 1002210110010121112 |
4 | 121132312113101 |
5 | 1333421024033 |
6 | 110231103105 |
7 | 13410560252 |
oct | 3136662721 |
9 | 1083403545 |
10 | 427517393 |
11 | 1aa360166 |
12 | bb211a95 |
13 | 6a757594 |
14 | 40ac8b29 |
15 | 277ebc48 |
hex | 197b65d1 |
427517393 has 2 divisors, whose sum is σ = 427517394. Its totient is φ = 427517392.
The previous prime is 427517359. The next prime is 427517413. The reversal of 427517393 is 393715724.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 394936129 + 32581264 = 19873^2 + 5708^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-427517393 is a prime.
It is a super-2 number, since 2×4275173932 = 365542242635032898, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 427517393.
It is not a weakly prime, because it can be changed into another prime (427517093) 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 as a sum of consecutive naturals, namely, 213758696 + 213758697.
It is an arithmetic number, because the mean of its divisors is an integer number (213758697).
Almost surely, 2427517393 is an apocalyptic number.
It is an amenable number.
427517393 is a deficient number, since it is larger than the sum of its proper divisors (1).
427517393 is an equidigital number, since it uses as much as digits as its factorization.
427517393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 158760, while the sum is 41.
The square root of 427517393 is about 20676.4937308046. The cubic root of 427517393 is about 753.3288435049.
The spelling of 427517393 in words is "four hundred twenty-seven million, five hundred seventeen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •