Base | Representation |
---|---|
bin | 1011001110011001… |
… | …1100100101011111 |
3 | 21202222212102122021 |
4 | 2303212130211133 |
5 | 22132334401343 |
6 | 1214555201011 |
7 | 134445531205 |
oct | 26346344537 |
9 | 7688772567 |
10 | 3013200223 |
11 | 1306966a20 |
12 | 701146167 |
13 | 390356917 |
14 | 208281075 |
15 | 1298000ed |
hex | b399c95f |
3013200223 has 4 divisors (see below), whose sum is σ = 3287127528. Its totient is φ = 2739272920.
The previous prime is 3013200193. The next prime is 3013200263. The reversal of 3013200223 is 3220023103.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3013200223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3013200197 and 3013200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013200263) 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, 136963636 + ... + 136963657.
It is an arithmetic number, because the mean of its divisors is an integer number (821781882).
Almost surely, 23013200223 is an apocalyptic number.
3013200223 is a deficient number, since it is larger than the sum of its proper divisors (273927305).
3013200223 is a wasteful number, since it uses less digits than its factorization.
3013200223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273927304.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 3013200223 is about 54892.6244863552. The cubic root of 3013200223 is about 1444.3618104310.
Adding to 3013200223 its reverse (3220023103), we get a palindrome (6233223326).
The spelling of 3013200223 in words is "three billion, thirteen million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •