Base | Representation |
---|---|
bin | 1111000000110110… |
… | …0111101001011111 |
3 | 101101212100101210011 |
4 | 3300031213221133 |
5 | 31223201231421 |
6 | 1503523024051 |
7 | 201604205560 |
oct | 36015475137 |
9 | 11355311704 |
10 | 4030102111 |
11 | 1788984402 |
12 | 94580b027 |
13 | 4c2c31009 |
14 | 2a334c167 |
15 | 188c1e4e1 |
hex | f0367a5f |
4030102111 has 4 divisors (see below), whose sum is σ = 4605830992. Its totient is φ = 3454373232.
The previous prime is 4030102081. The next prime is 4030102133. The reversal of 4030102111 is 1112010304.
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 4030102111 - 25 = 4030102079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4030102091 and 4030102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4030102171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 287864430 + ... + 287864443.
It is an arithmetic number, because the mean of its divisors is an integer number (1151457748).
Almost surely, 24030102111 is an apocalyptic number.
4030102111 is a deficient number, since it is larger than the sum of its proper divisors (575728881).
4030102111 is an equidigital number, since it uses as much as digits as its factorization.
4030102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575728880.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 4030102111 is about 63483.0852353601. The cubic root of 4030102111 is about 1591.3731148348.
Adding to 4030102111 its reverse (1112010304), we get a palindrome (5142112415).
The spelling of 4030102111 in words is "four billion, thirty million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •