Base | Representation |
---|---|
bin | 1000101011100101… |
… | …11011100110000010 |
3 | 110000210211001100010 |
4 | 10111302323212002 |
5 | 34021110441010 |
6 | 2050245405350 |
7 | 223331534046 |
oct | 42562734602 |
9 | 13023731303 |
10 | 4660640130 |
11 | 1a8189aa03 |
12 | aa0a09856 |
13 | 59375c733 |
14 | 322da4026 |
15 | 1c4270620 |
hex | 115cbb982 |
4660640130 has 64 divisors (see below), whose sum is σ = 11561730048. Its totient is φ = 1201145280.
The previous prime is 4660640113. The next prime is 4660640137. The reversal of 4660640130 is 310460664.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (4660640137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 799687 + ... + 805493.
It is an arithmetic number, because the mean of its divisors is an integer number (180652032).
Almost surely, 24660640130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4660640130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5780865024).
4660640130 is an abundant number, since it is smaller than the sum of its proper divisors (6901089918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4660640130 is a wasteful number, since it uses less digits than its factorization.
4660640130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6711.
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 4660640130 is about 68268.8811245651. The cubic root of 4660640130 is about 1670.3796488266.
It can be divided in two parts, 46606 and 40130, that added together give a triangular number (86736 = T416).
The spelling of 4660640130 in words is "four billion, six hundred sixty million, six hundred forty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •