Base | Representation |
---|---|
bin | 1110111110111010… |
… | …1111001101110101 |
3 | 101101022010002220002 |
4 | 3233232233031311 |
5 | 31214113203040 |
6 | 1503033321045 |
7 | 201445330616 |
oct | 35756571565 |
9 | 11338102802 |
10 | 4022006645 |
11 | 1784355138 |
12 | 942b66185 |
13 | 4c13582b7 |
14 | 2a2241c0d |
15 | 188170a15 |
hex | efbaf375 |
4022006645 has 8 divisors (see below), whose sum is σ = 4827241656. Its totient is φ = 3217049536.
The previous prime is 4022006633. The next prime is 4022006687. The reversal of 4022006645 is 5466002204.
It can be written as a sum of positive squares in 4 ways, for example, as 447999556 + 3574007089 = 21166^2 + 59783^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4022006645 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36182 + ... + 96711.
It is an arithmetic number, because the mean of its divisors is an integer number (603405207).
Almost surely, 24022006645 is an apocalyptic number.
It is an amenable number.
4022006645 is a deficient number, since it is larger than the sum of its proper divisors (805235011).
4022006645 is a wasteful number, since it uses less digits than its factorization.
4022006645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138951.
The product of its (nonzero) digits is 11520, while the sum is 29.
The square root of 4022006645 is about 63419.2923722742. The cubic root of 4022006645 is about 1590.3068438565.
Adding to 4022006645 its reverse (5466002204), we get a palindrome (9488008849).
The spelling of 4022006645 in words is "four billion, twenty-two million, six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •