Base | Representation |
---|---|
bin | 1000000110110011… |
… | …00100100001000001 |
3 | 102020022001121120110 |
4 | 10003121210201001 |
5 | 32403103031423 |
6 | 1555502301533 |
7 | 212563256544 |
oct | 40331444101 |
9 | 12208047513 |
10 | 4352002113 |
11 | 1933656668 |
12 | a155878a9 |
13 | 544828ca4 |
14 | 2d3dc285b |
15 | 1a7107193 |
hex | 103664841 |
4352002113 has 8 divisors (see below), whose sum is σ = 5944198176. Its totient is φ = 2830570400.
The previous prime is 4352002099. The next prime is 4352002121. The reversal of 4352002113 is 3112002534.
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 4352002113 - 216 = 4351936577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4352002113.
It is not an unprimeable number, because it can be changed into a prime (4352002153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17690943 + ... + 17691188.
It is an arithmetic number, because the mean of its divisors is an integer number (743024772).
Almost surely, 24352002113 is an apocalyptic number.
It is an amenable number.
4352002113 is a deficient number, since it is larger than the sum of its proper divisors (1592196063).
4352002113 is a wasteful number, since it uses less digits than its factorization.
4352002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35382175.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 4352002113 is about 65969.7060248111. The cubic root of 4352002113 is about 1632.6623049990.
Adding to 4352002113 its reverse (3112002534), we get a palindrome (7464004647).
The spelling of 4352002113 in words is "four billion, three hundred fifty-two million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •