Base | Representation |
---|---|
bin | 1111000011111011… |
… | …1111010010100001 |
3 | 101102202200220201102 |
4 | 3300332333102201 |
5 | 31240004402001 |
6 | 1505104244145 |
7 | 202122210203 |
oct | 36076772241 |
9 | 11382626642 |
10 | 4043044001 |
11 | 1795213887 |
12 | 94a010655 |
13 | 4c5812939 |
14 | 2a4d5a773 |
15 | 189e28e6b |
hex | f0fbf4a1 |
4043044001 has 4 divisors (see below), whose sum is σ = 4044719172. Its totient is φ = 4041368832.
The previous prime is 4043043973. The next prime is 4043044021. The reversal of 4043044001 is 1004403404.
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 3912627601 + 130416400 = 62551^2 + 11420^2 .
It is a cyclic number.
It is not a de Polignac number, because 4043044001 - 214 = 4043027617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4043044021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 833960 + ... + 838793.
It is an arithmetic number, because the mean of its divisors is an integer number (1011179793).
Almost surely, 24043044001 is an apocalyptic number.
It is an amenable number.
4043044001 is a deficient number, since it is larger than the sum of its proper divisors (1675171).
4043044001 is a wasteful number, since it uses less digits than its factorization.
4043044001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675170.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 4043044001 is about 63584.9353306269. The cubic root of 4043044001 is about 1593.0747565026.
Adding to 4043044001 its reverse (1004403404), we get a palindrome (5047447405).
The spelling of 4043044001 in words is "four billion, forty-three million, forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •