Base | Representation |
---|---|
bin | 111010100010001011100… |
… | …101100001111000110101 |
3 | 112020112121011001210012110 |
4 | 322202023211201320311 |
5 | 1011400414400311323 |
6 | 12315513541441233 |
7 | 563416411401162 |
oct | 72421345417065 |
9 | 15215534053173 |
10 | 4022431260213 |
11 | 13109a3644453 |
12 | 54b6a8110219 |
13 | 2324100b5782 |
14 | dc9884a1069 |
15 | 6e9753c4793 |
hex | 3a88b961e35 |
4022431260213 has 8 divisors (see below), whose sum is σ = 5364133942176. Its totient is φ = 2681174709200.
The previous prime is 4022431260191. The next prime is 4022431260217. The reversal of 4022431260213 is 3120621342204.
4022431260213 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 4022431260213 - 29 = 4022431259701 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4022431260217) 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, 111511698 + ... + 111547763.
It is an arithmetic number, because the mean of its divisors is an integer number (670516742772).
Almost surely, 24022431260213 is an apocalyptic number.
It is an amenable number.
4022431260213 is a deficient number, since it is larger than the sum of its proper divisors (1341702681963).
4022431260213 is a wasteful number, since it uses less digits than its factorization.
4022431260213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223065475.
The product of its (nonzero) digits is 13824, while the sum is 30.
The spelling of 4022431260213 in words is "four trillion, twenty-two billion, four hundred thirty-one million, two hundred sixty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •