Base | Representation |
---|---|
bin | 1110111110110000… |
… | …1000100011111111 |
3 | 101101020211102112002 |
4 | 3233230020203333 |
5 | 31213424332111 |
6 | 1503010532515 |
7 | 201436455524 |
oct | 35754104377 |
9 | 11336742462 |
10 | 4021324031 |
11 | 1783a2929a |
12 | 94289713b |
13 | 4c117969a |
14 | 2a210514b |
15 | 18808863b |
hex | efb088ff |
4021324031 has 4 divisors (see below), whose sum is σ = 4027842192. Its totient is φ = 4014805872.
The previous prime is 4021324019. The next prime is 4021324033. The reversal of 4021324031 is 1304231204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4021324031 - 26 = 4021323967 is a prime.
It is a super-2 number, since 2×40213240312 = 32342093924596177922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4021323994 and 4021324012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021324033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3258155 + ... + 3259388.
It is an arithmetic number, because the mean of its divisors is an integer number (1006960548).
Almost surely, 24021324031 is an apocalyptic number.
4021324031 is a deficient number, since it is larger than the sum of its proper divisors (6518161).
4021324031 is an equidigital number, since it uses as much as digits as its factorization.
4021324031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6518160.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 4021324031 is about 63413.9103903867. The cubic root of 4021324031 is about 1590.2168699345.
Adding to 4021324031 its reverse (1304231204), we get a palindrome (5325555235).
The spelling of 4021324031 in words is "four billion, twenty-one million, three hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •