Base | Representation |
---|---|
bin | 1111000001000100… |
… | …1000000101101101 |
3 | 101101221002002211200 |
4 | 3300101020011231 |
5 | 31223420141141 |
6 | 1503554440113 |
7 | 201615055020 |
oct | 36021100555 |
9 | 11357062750 |
10 | 4031021421 |
11 | 1789452069 |
12 | 945b93039 |
13 | 4c319359b |
14 | 2a350b1b7 |
15 | 188d51ab6 |
hex | f044816d |
4031021421 has 12 divisors (see below), whose sum is σ = 6654384672. Its totient is φ = 2303440776.
The previous prime is 4031021413. The next prime is 4031021461. The reversal of 4031021421 is 1241201304.
It is not a de Polignac number, because 4031021421 - 23 = 4031021413 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4031021394 and 4031021403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4031021461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31992171 + ... + 31992296.
It is an arithmetic number, because the mean of its divisors is an integer number (554532056).
Almost surely, 24031021421 is an apocalyptic number.
It is an amenable number.
4031021421 is a deficient number, since it is larger than the sum of its proper divisors (2623363251).
4031021421 is a wasteful number, since it uses less digits than its factorization.
4031021421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63984480 (or 63984477 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 4031021421 is about 63490.3254126170. The cubic root of 4031021421 is about 1591.4941087908.
Adding to 4031021421 its reverse (1241201304), we get a palindrome (5272222725).
The spelling of 4031021421 in words is "four billion, thirty-one million, twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •