Base | Representation |
---|---|
bin | 1110110001010011… |
… | …1010001001101101 |
3 | 101020022122222211222 |
4 | 3230110322021231 |
5 | 31110003412140 |
6 | 1453233353125 |
7 | 200153062004 |
oct | 35424721155 |
9 | 11208588758 |
10 | 3964904045 |
11 | 17550a3103 |
12 | 927a087a5 |
13 | 4b258408b |
14 | 298819c3b |
15 | 1831415b5 |
hex | ec53a26d |
3964904045 has 4 divisors (see below), whose sum is σ = 4757884860. Its totient is φ = 3171923232.
The previous prime is 3964904011. The next prime is 3964904071. The reversal of 3964904045 is 5404094693.
It is a happy number.
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 1525136809 + 2439767236 = 39053^2 + 49394^2 .
It is a cyclic number.
It is not a de Polignac number, because 3964904045 - 26 = 3964903981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3964903987 and 3964904005.
It is a congruent number.
It is an unprimeable number.
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, 396490400 + ... + 396490409.
It is an arithmetic number, because the mean of its divisors is an integer number (1189471215).
Almost surely, 23964904045 is an apocalyptic number.
It is an amenable number.
3964904045 is a deficient number, since it is larger than the sum of its proper divisors (792980815).
3964904045 is an equidigital number, since it uses as much as digits as its factorization.
3964904045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 792980814.
The product of its (nonzero) digits is 466560, while the sum is 44.
The square root of 3964904045 is about 62967.4840294576. The cubic root of 3964904045 is about 1582.7447943244.
The spelling of 3964904045 in words is "three billion, nine hundred sixty-four million, nine hundred four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •