Base | Representation |
---|---|
bin | 1111001001000101… |
… | …1101001011000101 |
3 | 101111021101020022221 |
4 | 3302101131023011 |
5 | 31311023142323 |
6 | 1511155452341 |
7 | 202504026103 |
oct | 36221351305 |
9 | 11437336287 |
10 | 4064662213 |
11 | 17a6439977 |
12 | 9552b70b1 |
13 | 4ca141791 |
14 | 2a7b86c73 |
15 | 18bc9955d |
hex | f245d2c5 |
4064662213 has 4 divisors (see below), whose sum is σ = 4064938668. Its totient is φ = 4064385760.
The previous prime is 4064662193. The next prime is 4064662253. The reversal of 4064662213 is 3122664604.
4064662213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2782879009 + 1281783204 = 52753^2 + 35802^2 .
It is a cyclic number.
It is not a de Polignac number, because 4064662213 - 25 = 4064662181 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 (4064662253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114856 + ... + 146017.
It is an arithmetic number, because the mean of its divisors is an integer number (1016234667).
Almost surely, 24064662213 is an apocalyptic number.
It is an amenable number.
4064662213 is a deficient number, since it is larger than the sum of its proper divisors (276455).
4064662213 is a wasteful number, since it uses less digits than its factorization.
4064662213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276454.
The product of its (nonzero) digits is 41472, while the sum is 34.
The square root of 4064662213 is about 63754.7034578626. The cubic root of 4064662213 is about 1595.9091082769.
The spelling of 4064662213 in words is "four billion, sixty-four million, six hundred sixty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •