Base | Representation |
---|---|
bin | 11001011110011… |
… | …010000000000001 |
3 | 1002210020020020201 |
4 | 121132122000001 |
5 | 1333403314332 |
6 | 110224405201 |
7 | 13406564455 |
oct | 3136320001 |
9 | 1083206221 |
10 | 427401217 |
11 | 1aa290951 |
12 | bb176801 |
13 | 6a716739 |
14 | 40a98665 |
15 | 277c75e7 |
hex | 1979a001 |
427401217 has 4 divisors (see below), whose sum is σ = 442139220. Its totient is φ = 412663216.
The previous prime is 427401211. The next prime is 427401223. The reversal of 427401217 is 712104724.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (427401211) and next prime (427401223).
It can be written as a sum of positive squares in 2 ways, for example, as 166126321 + 261274896 = 12889^2 + 16164^2 .
It is a cyclic number.
It is not a de Polignac number, because 427401217 - 27 = 427401089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (427401211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7368958 + ... + 7369015.
It is an arithmetic number, because the mean of its divisors is an integer number (110534805).
Almost surely, 2427401217 is an apocalyptic number.
It is an amenable number.
427401217 is a deficient number, since it is larger than the sum of its proper divisors (14738003).
427401217 is a wasteful number, since it uses less digits than its factorization.
427401217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14738002.
The product of its (nonzero) digits is 3136, while the sum is 28.
The square root of 427401217 is about 20673.6841661084. The cubic root of 427401217 is about 753.2605993726.
The spelling of 427401217 in words is "four hundred twenty-seven million, four hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •