Base | Representation |
---|---|
bin | 1111001110001101… |
… | …0000011110110001 |
3 | 101112202201200201111 |
4 | 3303203100132301 |
5 | 31332020343113 |
6 | 1513243233321 |
7 | 203154220402 |
oct | 36343203661 |
9 | 11482650644 |
10 | 4086106033 |
11 | 1807555a39 |
12 | 960518841 |
13 | 50170c129 |
14 | 2aa9699a9 |
15 | 18dad313d |
hex | f38d07b1 |
4086106033 has 2 divisors, whose sum is σ = 4086106034. Its totient is φ = 4086106032.
The previous prime is 4086106027. The next prime is 4086106081. The reversal of 4086106033 is 3306016804.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3940951729 + 145154304 = 62777^2 + 12048^2 .
It is a cyclic number.
It is not a de Polignac number, because 4086106033 - 217 = 4085974961 is a prime.
It is a super-3 number, since 3×40861060333 (a number of 30 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4086105986 and 4086106004.
It is not a weakly prime, because it can be changed into another prime (4086106093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2043053016 + 2043053017.
It is an arithmetic number, because the mean of its divisors is an integer number (2043053017).
Almost surely, 24086106033 is an apocalyptic number.
It is an amenable number.
4086106033 is a deficient number, since it is larger than the sum of its proper divisors (1).
4086106033 is an equidigital number, since it uses as much as digits as its factorization.
4086106033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The square root of 4086106033 is about 63922.6566484842. The cubic root of 4086106033 is about 1598.7106843667.
The spelling of 4086106033 in words is "four billion, eighty-six million, one hundred six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •