Base | Representation |
---|---|
bin | 1110111100100011… |
… | …1111000110001111 |
3 | 101100121111022112221 |
4 | 3233020333012033 |
5 | 31204100011343 |
6 | 1502041240211 |
7 | 201265242232 |
oct | 35710770617 |
9 | 11317438487 |
10 | 4012110223 |
11 | 1779805880 |
12 | 93b793067 |
13 | 4bc2a1924 |
14 | 2a0bc7419 |
15 | 1873685ed |
hex | ef23f18f |
4012110223 has 4 divisors (see below), whose sum is σ = 4376847528. Its totient is φ = 3647372920.
The previous prime is 4012110197. The next prime is 4012110233. The reversal of 4012110223 is 3220112104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4012110223 - 217 = 4011979151 is a prime.
It is a super-2 number, since 2×40121102232 = 32194056883002219458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4012110197 and 4012110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4012110233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182368636 + ... + 182368657.
It is an arithmetic number, because the mean of its divisors is an integer number (1094211882).
Almost surely, 24012110223 is an apocalyptic number.
4012110223 is a deficient number, since it is larger than the sum of its proper divisors (364737305).
4012110223 is a wasteful number, since it uses less digits than its factorization.
4012110223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364737304.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 4012110223 is about 63341.2205676525. The cubic root of 4012110223 is about 1589.0014197131.
Adding to 4012110223 its reverse (3220112104), we get a palindrome (7232222327).
The spelling of 4012110223 in words is "four billion, twelve million, one hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •