Base | Representation |
---|---|
bin | 1000100100011101… |
… | …1001111110101111 |
3 | 12221022122110000022 |
4 | 2021013121332233 |
5 | 14202401420030 |
6 | 1020133552355 |
7 | 111002150615 |
oct | 21107317657 |
9 | 5838573008 |
10 | 2300420015 |
11 | a80588673 |
12 | 5424a56bb |
13 | 2a879139a |
14 | 17b73b6b5 |
15 | d6e55de5 |
hex | 891d9faf |
2300420015 has 4 divisors (see below), whose sum is σ = 2760504024. Its totient is φ = 1840336008.
The previous prime is 2300420011. The next prime is 2300420027. The reversal of 2300420015 is 5100240032.
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 2300420015 - 22 = 2300420011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2300419975 and 2300420002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300420011) 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, 230041997 + ... + 230042006.
It is an arithmetic number, because the mean of its divisors is an integer number (690126006).
Almost surely, 22300420015 is an apocalyptic number.
2300420015 is a deficient number, since it is larger than the sum of its proper divisors (460084009).
2300420015 is an equidigital number, since it uses as much as digits as its factorization.
2300420015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460084008.
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 2300420015 is about 47962.6939923103. The cubic root of 2300420015 is about 1320.0864679736.
Adding to 2300420015 its reverse (5100240032), we get a palindrome (7400660047).
The spelling of 2300420015 in words is "two billion, three hundred million, four hundred twenty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •