Base | Representation |
---|---|
bin | 1110111100010100… |
… | …1001000000000101 |
3 | 101100112121002211020 |
4 | 3233011021000011 |
5 | 31203320232323 |
6 | 1502003501353 |
7 | 201253543356 |
oct | 35705110005 |
9 | 11315532736 |
10 | 4011102213 |
11 | 1779187508 |
12 | 93b387859 |
13 | 4bc00ab81 |
14 | 2a0a03d2d |
15 | 187219ae3 |
hex | ef149005 |
4011102213 has 8 divisors (see below), whose sum is σ = 5662732608. Its totient is φ = 2516769984.
The previous prime is 4011102203. The next prime is 4011102287. The reversal of 4011102213 is 3122011104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4011102213 - 26 = 4011102149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4011102192 and 4011102201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4011102203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39324481 + ... + 39324582.
It is an arithmetic number, because the mean of its divisors is an integer number (707841576).
Almost surely, 24011102213 is an apocalyptic number.
It is an amenable number.
4011102213 is a deficient number, since it is larger than the sum of its proper divisors (1651630395).
4011102213 is a wasteful number, since it uses less digits than its factorization.
4011102213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78649083.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 4011102213 is about 63333.2630850488. The cubic root of 4011102213 is about 1588.8683340141.
Adding to 4011102213 its reverse (3122011104), we get a palindrome (7133113317).
The spelling of 4011102213 in words is "four billion, eleven million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •