Base | Representation |
---|---|
bin | 1110001011100001… |
… | …0111001111000101 |
3 | 100211021110110220201 |
4 | 3202320113033011 |
5 | 30243421113203 |
6 | 1425412530501 |
7 | 163220042023 |
oct | 34270271705 |
9 | 10737413821 |
10 | 3806426053 |
11 | 16836a0261 |
12 | 8a2920a31 |
13 | 4887a7311 |
14 | 281765713 |
15 | 174289e1d |
hex | e2e173c5 |
3806426053 has 4 divisors (see below), whose sum is σ = 3806995648. Its totient is φ = 3805856460.
The previous prime is 3806426051. The next prime is 3806426081. The reversal of 3806426053 is 3506246083.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3806426053 - 21 = 3806426051 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3806426051) 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 3 ways as a sum of consecutive naturals, for example, 274653 + ... + 288178.
It is an arithmetic number, because the mean of its divisors is an integer number (951748912).
Almost surely, 23806426053 is an apocalyptic number.
It is an amenable number.
3806426053 is a deficient number, since it is larger than the sum of its proper divisors (569595).
3806426053 is an equidigital number, since it uses as much as digits as its factorization.
3806426053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569594.
The product of its (nonzero) digits is 103680, while the sum is 37.
The square root of 3806426053 is about 61696.2401852820. The cubic root of 3806426053 is about 1561.3698865866.
The spelling of 3806426053 in words is "three billion, eight hundred six million, four hundred twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •