Base | Representation |
---|---|
bin | 1110011000100010… |
… | …0111111010110001 |
3 | 100222002012011012020 |
4 | 3212020213322301 |
5 | 30401410122322 |
6 | 1435043022053 |
7 | 164452063026 |
oct | 34610477261 |
9 | 10862164166 |
10 | 3861020337 |
11 | 17014997a9 |
12 | 8b906a929 |
13 | 496bb0925 |
14 | 288ad754d |
15 | 178e7105c |
hex | e6227eb1 |
3861020337 has 8 divisors (see below), whose sum is σ = 5287163136. Its totient is φ = 2504445552.
The previous prime is 3861020309. The next prime is 3861020369. The reversal of 3861020337 is 7330201683.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3861020337 - 214 = 3861003953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3861020298 and 3861020307.
It is not an unprimeable number, because it can be changed into a prime (3861020377) 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 in 7 ways as a sum of consecutive naturals, for example, 17391873 + ... + 17392094.
It is an arithmetic number, because the mean of its divisors is an integer number (660895392).
Almost surely, 23861020337 is an apocalyptic number.
3861020337 is a gapful number since it is divisible by the number (37) formed by its first and last digit.
It is an amenable number.
3861020337 is a deficient number, since it is larger than the sum of its proper divisors (1426142799).
3861020337 is a wasteful number, since it uses less digits than its factorization.
3861020337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34784007.
The product of its (nonzero) digits is 18144, while the sum is 33.
The square root of 3861020337 is about 62137.1091780105. The cubic root of 3861020337 is about 1568.7992139564.
The spelling of 3861020337 in words is "three billion, eight hundred sixty-one million, twenty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •