Base | Representation |
---|---|
bin | 1011001110011001… |
… | …1100100010010111 |
3 | 21202222212102100212 |
4 | 2303212130202113 |
5 | 22132334400043 |
6 | 1214555200035 |
7 | 134445530501 |
oct | 26346344227 |
9 | 7688772325 |
10 | 3013200023 |
11 | 1306966859 |
12 | 70114601b |
13 | 3903567c2 |
14 | 208280d71 |
15 | 129800018 |
hex | b399c897 |
3013200023 has 4 divisors (see below), whose sum is σ = 3019239000. Its totient is φ = 3007161048.
The previous prime is 3013200019. The next prime is 3013200041. The reversal of 3013200023 is 3200023103.
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 3013200023 - 22 = 3013200019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3013199980 and 3013200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013200013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3018740 + ... + 3019737.
It is an arithmetic number, because the mean of its divisors is an integer number (754809750).
Almost surely, 23013200023 is an apocalyptic number.
3013200023 is a deficient number, since it is larger than the sum of its proper divisors (6038977).
3013200023 is an equidigital number, since it uses as much as digits as its factorization.
3013200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6038976.
The product of its (nonzero) digits is 108, while the sum is 14.
The square root of 3013200023 is about 54892.6226646168. The cubic root of 3013200023 is about 1444.3617784747.
Adding to 3013200023 its reverse (3200023103), we get a palindrome (6213223126).
The spelling of 3013200023 in words is "three billion, thirteen million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •