Base | Representation |
---|---|
bin | 1111001010100001… |
… | …1000111001011011 |
3 | 101111200200122222010 |
4 | 3302220120321123 |
5 | 31314043032021 |
6 | 1511532401003 |
7 | 202606105155 |
oct | 36250307133 |
9 | 11450618863 |
10 | 4070674011 |
11 | 17a98756a8 |
12 | 957316163 |
13 | 4cb467c61 |
14 | 2a88adad5 |
15 | 18c585976 |
hex | f2a18e5b |
4070674011 has 4 divisors (see below), whose sum is σ = 5427565352. Its totient is φ = 2713782672.
The previous prime is 4070674007. The next prime is 4070674037. The reversal of 4070674011 is 1104760704.
4070674011 is digitally balanced in base 3, 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 is not a de Polignac number, because 4070674011 - 22 = 4070674007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4070674011.
It is not an unprimeable number, because it can be changed into a prime (4070674061) 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, 678445666 + ... + 678445671.
It is an arithmetic number, because the mean of its divisors is an integer number (1356891338).
Almost surely, 24070674011 is an apocalyptic number.
4070674011 is a deficient number, since it is larger than the sum of its proper divisors (1356891341).
4070674011 is a wasteful number, since it uses less digits than its factorization.
4070674011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356891340.
The product of its (nonzero) digits is 4704, while the sum is 30.
The square root of 4070674011 is about 63801.8339156485. The cubic root of 4070674011 is about 1596.6955251594.
The spelling of 4070674011 in words is "four billion, seventy million, six hundred seventy-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •