Base | Representation |
---|---|
bin | 11001011111100… |
… | …101101001101001 |
3 | 1002210210222022011 |
4 | 121133211221221 |
5 | 1333443223311 |
6 | 110235155521 |
7 | 13412325040 |
oct | 3137455151 |
9 | 1083728264 |
10 | 427711081 |
11 | 1aa482736 |
12 | bb2a5ba1 |
13 | 6a7c47a5 |
14 | 40b39557 |
15 | 27839321 |
hex | 197e5a69 |
427711081 has 4 divisors (see below), whose sum is σ = 488812672. Its totient is φ = 366609492.
The previous prime is 427711079. The next prime is 427711087. The reversal of 427711081 is 180117724.
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 427711081 - 21 = 427711079 is a prime.
It is a super-3 number, since 3×4277110813 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (427711087) 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 in 3 ways as a sum of consecutive naturals, for example, 30550785 + ... + 30550798.
It is an arithmetic number, because the mean of its divisors is an integer number (122203168).
Almost surely, 2427711081 is an apocalyptic number.
It is an amenable number.
427711081 is a deficient number, since it is larger than the sum of its proper divisors (61101591).
427711081 is an equidigital number, since it uses as much as digits as its factorization.
427711081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61101590.
The product of its (nonzero) digits is 3136, while the sum is 31.
The square root of 427711081 is about 20681.1769732769. The cubic root of 427711081 is about 753.4425922707.
The spelling of 427711081 in words is "four hundred twenty-seven million, seven hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •