Base | Representation |
---|---|
bin | 110001001011… |
… | …000110101101 |
3 | 220020220111110 |
4 | 301023012231 |
5 | 11244444131 |
6 | 1140142233 |
7 | 214365516 |
oct | 61130655 |
9 | 26226443 |
10 | 12890541 |
11 | 7304944 |
12 | 4397979 |
13 | 2894451 |
14 | 19d7a0d |
15 | 11e9646 |
hex | c4b1ad |
12890541 has 8 divisors (see below), whose sum is σ = 17652064. Its totient is φ = 8361360.
The previous prime is 12890491. The next prime is 12890543. The reversal of 12890541 is 14509821.
It is a happy number.
12890541 is digitally balanced in base 2, base 3 and base 4, because in such bases 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 not a de Polignac number, because 12890541 - 26 = 12890477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12890499 and 12890508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12890543) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57955 + ... + 58176.
It is an arithmetic number, because the mean of its divisors is an integer number (2206508).
Almost surely, 212890541 is an apocalyptic number.
It is an amenable number.
12890541 is a deficient number, since it is larger than the sum of its proper divisors (4761523).
12890541 is a wasteful number, since it uses less digits than its factorization.
12890541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116171.
The product of its (nonzero) digits is 2880, while the sum is 30.
The square root of 12890541 is about 3590.3399560487. The cubic root of 12890541 is about 234.4716726178.
It can be divided in two parts, 12890 and 541, that added together give a palindrome (13431).
The spelling of 12890541 in words is "twelve million, eight hundred ninety thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •