Base | Representation |
---|---|
bin | 1110001010010001… |
… | …1100100111011101 |
3 | 100210220122020021021 |
4 | 3202210130213131 |
5 | 30241102031323 |
6 | 1425105004141 |
7 | 163124465641 |
oct | 34244344735 |
9 | 10726566237 |
10 | 3801205213 |
11 | 1680754813 |
12 | 8a1023651 |
13 | 487699b70 |
14 | 280ba6c21 |
15 | 173aa805d |
hex | e291c9dd |
3801205213 has 16 divisors (see below), whose sum is σ = 4297305600. Its totient is φ = 3338043840.
The previous prime is 3801205201. The next prime is 3801205223. The reversal of 3801205213 is 3125021083.
It is a cyclic number.
It is not a de Polignac number, because 3801205213 - 25 = 3801205181 is a prime.
It is a super-2 number, since 2×38012052132 = 28898322142676750738, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3801205223) 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 15 ways as a sum of consecutive naturals, for example, 56158 + ... + 103711.
It is an arithmetic number, because the mean of its divisors is an integer number (268581600).
Almost surely, 23801205213 is an apocalyptic number.
It is an amenable number.
3801205213 is a deficient number, since it is larger than the sum of its proper divisors (496100387).
3801205213 is a wasteful number, since it uses less digits than its factorization.
3801205213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159972.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 3801205213 is about 61653.9148229859. The cubic root of 3801205213 is about 1560.6557090362.
Adding to 3801205213 its reverse (3125021083), we get a palindrome (6926226296).
The spelling of 3801205213 in words is "three billion, eight hundred one million, two hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •