Base | Representation |
---|---|
bin | 1011010000110010… |
… | …0110101011000101 |
3 | 21210200200121212222 |
4 | 2310030212223011 |
5 | 22142414444023 |
6 | 1215553422125 |
7 | 134626541645 |
oct | 26414465305 |
9 | 7720617788 |
10 | 3023203013 |
11 | 1311579196 |
12 | 70456a945 |
13 | 39244982c |
14 | 209726525 |
15 | 12a628cc8 |
hex | b4326ac5 |
3023203013 has 4 divisors (see below), whose sum is σ = 3023388480. Its totient is φ = 3023017548.
The previous prime is 3023202979. The next prime is 3023203061. The reversal of 3023203013 is 3103023203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3023203013 - 28 = 3023202757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3023202982 and 3023203000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3023203063) 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, 65645 + ... + 101762.
It is an arithmetic number, because the mean of its divisors is an integer number (755847120).
Almost surely, 23023203013 is an apocalyptic number.
It is an amenable number.
3023203013 is a deficient number, since it is larger than the sum of its proper divisors (185467).
3023203013 is a wasteful number, since it uses less digits than its factorization.
3023203013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185466.
The product of its (nonzero) digits is 324, while the sum is 17.
The square root of 3023203013 is about 54983.6613277072. The cubic root of 3023203013 is about 1445.9583068632.
Adding to 3023203013 its reverse (3103023203), we get a palindrome (6126226216).
The spelling of 3023203013 in words is "three billion, twenty-three million, two hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •