Base | Representation |
---|---|
bin | 11001011110011… |
… | …101001011110101 |
3 | 1002210020220010211 |
4 | 121132131023311 |
5 | 1333404224021 |
6 | 110224545421 |
7 | 13406650501 |
oct | 3136351365 |
9 | 1083226124 |
10 | 427414261 |
11 | 1aa29a72a |
12 | bb182271 |
13 | 6a71c661 |
14 | 40a9d301 |
15 | 277cb3e1 |
hex | 1979d2f5 |
427414261 has 4 divisors (see below), whose sum is σ = 429652224. Its totient is φ = 425176300.
The previous prime is 427414243. The next prime is 427414307. The reversal of 427414261 is 162414724.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 427414261 - 211 = 427412213 is a prime.
It is a super-2 number, since 2×4274142612 = 365365901012352242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427414201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1118695 + ... + 1119076.
It is an arithmetic number, because the mean of its divisors is an integer number (107413056).
Almost surely, 2427414261 is an apocalyptic number.
It is an amenable number.
427414261 is a deficient number, since it is larger than the sum of its proper divisors (2237963).
427414261 is a wasteful number, since it uses less digits than its factorization.
427414261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2237962.
The product of its digits is 10752, while the sum is 31.
The square root of 427414261 is about 20673.9996372255. Note that the first 3 decimals coincide. The cubic root of 427414261 is about 753.2682622983.
Adding to 427414261 its reverse (162414724), we get a palindrome (589828985).
The spelling of 427414261 in words is "four hundred twenty-seven million, four hundred fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •