Base | Representation |
---|---|
bin | 111010001111100011000… |
… | …100110001010011000111 |
3 | 112011121221211022101211121 |
4 | 322033203010301103013 |
5 | 1011033431100343421 |
6 | 12302404401414411 |
7 | 562110542430235 |
oct | 72174304612307 |
9 | 15147854271747 |
10 | 4002424231111 |
11 | 1303467154359 |
12 | 54784393a407 |
13 | 230572119607 |
14 | dba0b2a9955 |
15 | 6e1a3c1ad41 |
hex | 3a3e31314c7 |
4002424231111 has 8 divisors (see below), whose sum is σ = 4140468558000. Its totient is φ = 3864381884160.
The previous prime is 4002424231049. The next prime is 4002424231121. The reversal of 4002424231111 is 1111324242004.
4002424231111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4002424231111 - 221 = 4002422133959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4002424231121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4457815 + ... + 5279863.
It is an arithmetic number, because the mean of its divisors is an integer number (517558569750).
Almost surely, 24002424231111 is an apocalyptic number.
4002424231111 is a deficient number, since it is larger than the sum of its proper divisors (138044326889).
4002424231111 is a wasteful number, since it uses less digits than its factorization.
4002424231111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 989969.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 4002424231111 its reverse (1111324242004), we get a palindrome (5113748473115).
The spelling of 4002424231111 in words is "four trillion, two billion, four hundred twenty-four million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •