Base | Representation |
---|---|
bin | 1110111010101000… |
… | …1100110110111001 |
3 | 101100001022022110021 |
4 | 3232222030312321 |
5 | 31200013240441 |
6 | 1501152250441 |
7 | 201136531234 |
oct | 35652146671 |
9 | 11301268407 |
10 | 4004040121 |
11 | 17751a3674 |
12 | 938b40a21 |
13 | 4ba707613 |
14 | 29dac641b |
15 | 1867c23d1 |
hex | eea8cdb9 |
4004040121 has 8 divisors (see below), whose sum is σ = 4230241920. Its totient is φ = 3783713808.
The previous prime is 4004040119. The next prime is 4004040143. The reversal of 4004040121 is 1210404004.
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 4004040121 - 21 = 4004040119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4004040095 and 4004040104.
It is not an unprimeable number, because it can be changed into a prime (4004040421) 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 7 ways as a sum of consecutive naturals, for example, 1467471 + ... + 1470196.
It is an arithmetic number, because the mean of its divisors is an integer number (528780240).
Almost surely, 24004040121 is an apocalyptic number.
It is an amenable number.
4004040121 is a deficient number, since it is larger than the sum of its proper divisors (226201799).
4004040121 is a wasteful number, since it uses less digits than its factorization.
4004040121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2937743.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 4004040121 is about 63277.4851033130. The cubic root of 4004040121 is about 1587.9353131624.
Adding to 4004040121 its reverse (1210404004), we get a palindrome (5214444125).
The spelling of 4004040121 in words is "four billion, four million, forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •