Base | Representation |
---|---|
bin | 1111101110101101… |
… | …1011010000101111 |
3 | 101220021022110011020 |
4 | 3323223123100233 |
5 | 32121422340241 |
6 | 1534554025223 |
7 | 206431234536 |
oct | 37353332057 |
9 | 11807273136 |
10 | 4222465071 |
11 | 1877520560 |
12 | 99a118213 |
13 | 523a43156 |
14 | 2c0b0331d |
15 | 19aa6ab66 |
hex | fbadb42f |
4222465071 has 8 divisors (see below), whose sum is σ = 6141767424. Its totient is φ = 2559069720.
The previous prime is 4222465067. The next prime is 4222465099. The reversal of 4222465071 is 1705642224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4222465071 - 22 = 4222465067 is a prime.
It is a super-2 number, since 2×42224650712 = 35658422551630070082, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 127953487 = 4222465071 / (4 + 2 + 2 + 2 + 4 + 6 + 5 + 0 + 7 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4222465021) 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, 63976711 + ... + 63976776.
It is an arithmetic number, because the mean of its divisors is an integer number (767720928).
Almost surely, 24222465071 is an apocalyptic number.
4222465071 is a deficient number, since it is larger than the sum of its proper divisors (1919302353).
4222465071 is a wasteful number, since it uses less digits than its factorization.
4222465071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127953501.
The product of its (nonzero) digits is 26880, while the sum is 33.
The square root of 4222465071 is about 64980.4976204399. The cubic root of 4222465071 is about 1616.3001822384.
The spelling of 4222465071 in words is "four billion, two hundred twenty-two million, four hundred sixty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •