Search a number
-
+
4906627 = 111672671
BaseRepresentation
bin10010101101111010000011
3100020021121221
4102231322003
52224003002
6253055511
756464015
oct22557203
910207557
104906627
112851470
121787597
13102a43b
1491a1b5
1566dc37
hex4ade83

4906627 has 8 divisors (see below), whose sum is σ = 5386752. Its totient is φ = 4432200.

The previous prime is 4906621. The next prime is 4906631. The reversal of 4906627 is 7266094.

4906627 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 4906627 - 23 = 4906619 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 4906592 and 4906601.

It is not an unprimeable number, because it can be changed into a prime (4906621) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 502 + ... + 3172.

It is an arithmetic number, because the mean of its divisors is an integer number (673344).

Almost surely, 24906627 is an apocalyptic number.

4906627 is a deficient number, since it is larger than the sum of its proper divisors (480125).

4906627 is a wasteful number, since it uses less digits than its factorization.

4906627 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2849.

The product of its (nonzero) digits is 18144, while the sum is 34.

The square root of 4906627 is about 2215.0907430622. The cubic root of 4906627 is about 169.9264618499.

It can be divided in two parts, 490 and 6627, that added together give a palindrome (7117).

The spelling of 4906627 in words is "four million, nine hundred six thousand, six hundred twenty-seven".

Divisors: 1 11 167 1837 2671 29381 446057 4906627