Base | Representation |
---|---|
bin | 1011010000110010… |
… | …1011000100100111 |
3 | 21210200201112121022 |
4 | 2310030223010213 |
5 | 22142421033111 |
6 | 1215554041355 |
7 | 134626645325 |
oct | 26414530447 |
9 | 7720645538 |
10 | 3023221031 |
11 | 1311590786 |
12 | 70457925b |
13 | 392454aac |
14 | 20972cd15 |
15 | 12a62e2db |
hex | b432b127 |
3023221031 has 4 divisors (see below), whose sum is σ = 3034716432. Its totient is φ = 3011725632.
The previous prime is 3023221021. The next prime is 3023221063. The reversal of 3023221031 is 1301223203.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1301223203 = 7 ⋅185889029.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3023221031 is a prime.
It is a super-2 number, since 2×30232210312 = 18279730804561405922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3023221021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5747306 + ... + 5747831.
It is an arithmetic number, because the mean of its divisors is an integer number (758679108).
Almost surely, 23023221031 is an apocalyptic number.
3023221031 is a deficient number, since it is larger than the sum of its proper divisors (11495401).
3023221031 is a wasteful number, since it uses less digits than its factorization.
3023221031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11495400.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3023221031 is about 54983.8251761370. The cubic root of 3023221031 is about 1445.9611794484.
Adding to 3023221031 its reverse (1301223203), we get a palindrome (4324444234).
The spelling of 3023221031 in words is "three billion, twenty-three million, two hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •