Base | Representation |
---|---|
bin | 1110111101000100… |
… | …0011011001111110 |
3 | 101100202110202111211 |
4 | 3233101003121332 |
5 | 31210120200042 |
6 | 1502154435034 |
7 | 201322230643 |
oct | 35721033176 |
9 | 11322422454 |
10 | 4014225022 |
11 | 177aa1a745 |
12 | 940432a7a |
13 | 4bc8623a2 |
14 | 2a11b7dca |
15 | 187635017 |
hex | ef44367e |
4014225022 has 8 divisors (see below), whose sum is σ = 6022836072. Its totient is φ = 2006613000.
The previous prime is 4014224989. The next prime is 4014225023. The reversal of 4014225022 is 2205224104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×40142250222 = 32228005054501800968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4014224984 and 4014225002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4014225023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 239629 + ... + 255832.
It is an arithmetic number, because the mean of its divisors is an integer number (752854509).
Almost surely, 24014225022 is an apocalyptic number.
4014225022 is a deficient number, since it is larger than the sum of its proper divisors (2008611050).
4014225022 is a wasteful number, since it uses less digits than its factorization.
4014225022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499514.
The product of its (nonzero) digits is 1280, while the sum is 22.
The square root of 4014225022 is about 63357.9120710271. The cubic root of 4014225022 is about 1589.2805602958.
Adding to 4014225022 its reverse (2205224104), we get a palindrome (6219449126).
The spelling of 4014225022 in words is "four billion, fourteen million, two hundred twenty-five thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •