Base | Representation |
---|---|
bin | 100111010010… |
… | …101110010011 |
3 | 201101022100212 |
4 | 213102232103 |
5 | 10114102212 |
6 | 1004434335 |
7 | 153360023 |
oct | 47225623 |
9 | 21338325 |
10 | 10300307 |
11 | 58a5856 |
12 | 35489ab |
13 | 2198474 |
14 | 1521a83 |
15 | d86e22 |
hex | 9d2b93 |
10300307 has 8 divisors (see below), whose sum is σ = 10916640. Its totient is φ = 9701440.
The previous prime is 10300291. The next prime is 10300321. The reversal of 10300307 is 70300301.
It is a happy number.
10300307 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10300307 - 24 = 10300291 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300291 and 10300300.
It is not an unprimeable number, because it can be changed into a prime (10300327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3143 + ... + 5520.
It is an arithmetic number, because the mean of its divisors is an integer number (1364580).
Almost surely, 210300307 is an apocalyptic number.
10300307 is a deficient number, since it is larger than the sum of its proper divisors (616333).
10300307 is an equidigital number, since it uses as much as digits as its factorization.
10300307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8733.
The product of its (nonzero) digits is 63, while the sum is 14.
The square root of 10300307 is about 3209.4091356510. The cubic root of 10300307 is about 217.5788730547.
Adding to 10300307 its reverse (70300301), we get a palindrome (80600608).
The spelling of 10300307 in words is "ten million, three hundred thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •