Base | Representation |
---|---|
bin | 1111001010001011… |
… | …0110000111100101 |
3 | 101111120221211120212 |
4 | 3302202312013211 |
5 | 31313210031322 |
6 | 1511441305205 |
7 | 202560543413 |
oct | 36242660745 |
9 | 11446854525 |
10 | 4069220837 |
11 | 17a8a72930 |
12 | 956935205 |
13 | 4cb0796a6 |
14 | 2a86122b3 |
15 | 18c39a0e2 |
hex | f28b61e5 |
4069220837 has 8 divisors (see below), whose sum is σ = 4453613472. Its totient is φ = 3687238800.
The previous prime is 4069220773. The next prime is 4069220863. The reversal of 4069220837 is 7380229604.
It is a happy number.
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 4069220837 - 26 = 4069220773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4069220794 and 4069220803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4069220137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 599114 + ... + 605867.
It is an arithmetic number, because the mean of its divisors is an integer number (556701684).
Almost surely, 24069220837 is an apocalyptic number.
It is an amenable number.
4069220837 is a deficient number, since it is larger than the sum of its proper divisors (384392635).
4069220837 is a wasteful number, since it uses less digits than its factorization.
4069220837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1205299.
The product of its (nonzero) digits is 145152, while the sum is 41.
The square root of 4069220837 is about 63790.4447154901. Note that the first 3 decimals coincide. The cubic root of 4069220837 is about 1596.5055031816.
The spelling of 4069220837 in words is "four billion, sixty-nine million, two hundred twenty thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •