Base | Representation |
---|---|
bin | 110111011010… |
… | …011010101001 |
3 | 1000100000002111 |
4 | 313122122221 |
5 | 12204313441 |
6 | 1235202321 |
7 | 234320131 |
oct | 67323251 |
9 | 30300074 |
10 | 14526121 |
11 | 8221765 |
12 | 4a463a1 |
13 | 3017a4c |
14 | 1d01ac1 |
15 | 141e081 |
hex | dda6a9 |
14526121 has 2 divisors, whose sum is σ = 14526122. Its totient is φ = 14526120.
The previous prime is 14526119. The next prime is 14526139. The reversal of 14526121 is 12162541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9734400 + 4791721 = 3120^2 + 2189^2 .
It is an emirp because it is prime and its reverse (12162541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14526121 - 21 = 14526119 is a prime.
It is a super-2 number, since 2×145261212 = 422016382613282, which contains 22 as substring.
Together with 14526119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 14526092 and 14526101.
It is not a weakly prime, because it can be changed into another prime (14526221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7263060 + 7263061.
It is an arithmetic number, because the mean of its divisors is an integer number (7263061).
Almost surely, 214526121 is an apocalyptic number.
It is an amenable number.
14526121 is a deficient number, since it is larger than the sum of its proper divisors (1).
14526121 is an equidigital number, since it uses as much as digits as its factorization.
14526121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 480, while the sum is 22.
The square root of 14526121 is about 3811.3148649777. The cubic root of 14526121 is about 243.9962879038.
Adding to 14526121 its reverse (12162541), we get a palindrome (26688662).
The spelling of 14526121 in words is "fourteen million, five hundred twenty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •