Base | Representation |
---|---|
bin | 1111000000111000… |
… | …0010000001000001 |
3 | 101101212112212221020 |
4 | 3300032002001001 |
5 | 31223213210423 |
6 | 1503525220053 |
7 | 201605135466 |
oct | 36016020101 |
9 | 11355485836 |
10 | 4030210113 |
11 | 1788a48566 |
12 | 945861629 |
13 | 4c2c6b217 |
14 | 2a337966d |
15 | 188c414e3 |
hex | f0382041 |
4030210113 has 8 divisors (see below), whose sum is σ = 5374790400. Its totient is φ = 2686218288.
The previous prime is 4030210109. The next prime is 4030210117. The reversal of 4030210113 is 3110120304.
It is an interprime number because it is at equal distance from previous prime (4030210109) and next prime (4030210117).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4030210113 - 22 = 4030210109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4030210092 and 4030210101.
It is not an unprimeable number, because it can be changed into a prime (4030210117) 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, 130878 + ... + 158711.
It is an arithmetic number, because the mean of its divisors is an integer number (671848800).
Almost surely, 24030210113 is an apocalyptic number.
It is an amenable number.
4030210113 is a deficient number, since it is larger than the sum of its proper divisors (1344580287).
4030210113 is a wasteful number, since it uses less digits than its factorization.
4030210113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294231.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 4030210113 is about 63483.9358656976. The cubic root of 4030210113 is about 1591.3873303509.
Adding to 4030210113 its reverse (3110120304), we get a palindrome (7140330417).
The spelling of 4030210113 in words is "four billion, thirty million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •