Base | Representation |
---|---|
bin | 101110111000… |
… | …100111000101 |
3 | 212010102101202 |
4 | 232320213011 |
5 | 11121244001 |
6 | 1115232245 |
7 | 206316236 |
oct | 56704705 |
9 | 25112352 |
10 | 12290501 |
11 | 6a35043 |
12 | 4148685 |
13 | 27142b2 |
14 | 18bd08d |
15 | 112b96b |
hex | bb89c5 |
12290501 has 2 divisors, whose sum is σ = 12290502. Its totient is φ = 12290500.
The previous prime is 12290497. The next prime is 12290503. The reversal of 12290501 is 10509221.
12290501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12285025 + 5476 = 3505^2 + 74^2 .
It is a cyclic number.
It is not a de Polignac number, because 12290501 - 22 = 12290497 is a prime.
Together with 12290503, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12290503) 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 as a sum of consecutive naturals, namely, 6145250 + 6145251.
It is an arithmetic number, because the mean of its divisors is an integer number (6145251).
Almost surely, 212290501 is an apocalyptic number.
It is an amenable number.
12290501 is a deficient number, since it is larger than the sum of its proper divisors (1).
12290501 is an equidigital number, since it uses as much as digits as its factorization.
12290501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 12290501 is about 3505.7810827261. The cubic root of 12290501 is about 230.7755858563.
Adding to 12290501 its reverse (10509221), we get a palindrome (22799722).
The spelling of 12290501 in words is "twelve million, two hundred ninety thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •