Base | Representation |
---|---|
bin | 1110100101011010… |
… | …0001101011001101 |
3 | 101002211202102110202 |
4 | 3221112201223031 |
5 | 31004214341204 |
6 | 1444251543245 |
7 | 166005630521 |
oct | 35126415315 |
9 | 11084672422 |
10 | 3914996429 |
11 | 1729a05843 |
12 | 91315ab25 |
13 | 4a512ba46 |
14 | 291d47d81 |
15 | 17da83e1e |
hex | e95a1acd |
3914996429 has 8 divisors (see below), whose sum is σ = 3945603840. Its totient is φ = 3884469696.
The previous prime is 3914996413. The next prime is 3914996471. The reversal of 3914996429 is 9246994193.
3914996429 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3914996429 - 24 = 3914996413 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 (3914996629) 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, 79157 + ... + 118725.
It is an arithmetic number, because the mean of its divisors is an integer number (493200480).
Almost surely, 23914996429 is an apocalyptic number.
It is an amenable number.
3914996429 is a deficient number, since it is larger than the sum of its proper divisors (30607411).
3914996429 is a wasteful number, since it uses less digits than its factorization.
3914996429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40339.
The product of its digits is 3779136, while the sum is 56.
The square root of 3914996429 is about 62569.9323077786. The cubic root of 3914996429 is about 1576.0758825507.
The spelling of 3914996429 in words is "three billion, nine hundred fourteen million, nine hundred ninety-six thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •