Search a number
-
+
4626711040 = 2957292307
BaseRepresentation
bin1000100111100011…
…00000001000000000
3102221102222021101011
410103301200020000
533433414223130
62043034250304
7222440252320
oct42361401000
912842867334
104626711040
111a64726536
12a91586994
13589710253
1431c691280
151c12bc52a
hex113c60200

4626711040 has 240 divisors, whose sum is σ = 13173031872. Its totient is φ = 1526611968.

The previous prime is 4626710999. The next prime is 4626711043. The reversal of 4626711040 is 401176264.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15070567 + ... + 15070873.

Almost surely, 24626711040 is an apocalyptic number.

4626711040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 4626711040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6586515936).

4626711040 is an abundant number, since it is smaller than the sum of its proper divisors (8546320832).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

4626711040 is an equidigital number, since it uses as much as digits as its factorization.

4626711040 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 395 (or 350 counting only the distinct ones).

The product of its (nonzero) digits is 8064, while the sum is 31.

The square root of 4626711040 is about 68019.9311966721. The cubic root of 4626711040 is about 1666.3163622884.

The spelling of 4626711040 in words is "four billion, six hundred twenty-six million, seven hundred eleven thousand, forty".