Base | Representation |
---|---|
bin | 1011010000100100… |
… | …1010111111110111 |
3 | 21210121222220121102 |
4 | 2310021022333313 |
5 | 22142202200343 |
6 | 1215522240315 |
7 | 134616103442 |
oct | 26411127767 |
9 | 7717886542 |
10 | 3022303223 |
11 | 1311014165 |
12 | 7041b609b |
13 | 3921c3104 |
14 | 209570659 |
15 | 12a4ec3b8 |
hex | b424aff7 |
3022303223 has 4 divisors (see below), whose sum is σ = 3041553720. Its totient is φ = 3003052728.
The previous prime is 3022303199. The next prime is 3022303259. The reversal of 3022303223 is 3223032203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3022303223 - 28 = 3022302967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022303195 and 3022303204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022303423) 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, 9625013 + ... + 9625326.
It is an arithmetic number, because the mean of its divisors is an integer number (760388430).
Almost surely, 23022303223 is an apocalyptic number.
3022303223 is a deficient number, since it is larger than the sum of its proper divisors (19250497).
3022303223 is a wasteful number, since it uses less digits than its factorization.
3022303223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19250496.
The product of its (nonzero) digits is 1296, while the sum is 20.
The square root of 3022303223 is about 54975.4783790009. The cubic root of 3022303223 is about 1445.8148400480.
Adding to 3022303223 its reverse (3223032203), we get a palindrome (6245335426).
The spelling of 3022303223 in words is "three billion, twenty-two million, three hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •