Base | Representation |
---|---|
bin | 1110111100010011… |
… | …11011011111010001 |
3 | 202201002000112011000 |
4 | 13132021323133101 |
5 | 112412130042314 |
6 | 3404005412213 |
7 | 402536554146 |
oct | 73611733721 |
9 | 22632015130 |
10 | 8022112209 |
11 | 3447300701 |
12 | 167a70a069 |
13 | 9aacb5a77 |
14 | 5615c23cd |
15 | 31e417209 |
hex | 1de27b7d1 |
8022112209 has 8 divisors (see below), whose sum is σ = 11884610720. Its totient is φ = 5348074788.
The previous prime is 8022112199. The next prime is 8022112237. The reversal of 8022112209 is 9022112208.
It is not a de Polignac number, because 8022112209 - 28 = 8022111953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 297115267 = 8022112209 / (8 + 0 + 2 + 2 + 1 + 1 + 2 + 2 + 0 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8022112249) 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, 148557607 + ... + 148557660.
It is an arithmetic number, because the mean of its divisors is an integer number (1485576340).
Almost surely, 28022112209 is an apocalyptic number.
It is an amenable number.
8022112209 is a deficient number, since it is larger than the sum of its proper divisors (3862498511).
8022112209 is a wasteful number, since it uses less digits than its factorization.
8022112209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297115276 (or 297115270 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 8022112209 is about 89566.2448079632. The cubic root of 8022112209 is about 2001.8409889432.
Subtracting 8022112209 from its reverse (9022112208), we obtain a palindrome (999999999).
The spelling of 8022112209 in words is "eight billion, twenty-two million, one hundred twelve thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •