Base | Representation |
---|---|
bin | 101001111010000… |
… | …0001011111101101 |
3 | 10121222220122102112 |
4 | 1103310001133231 |
5 | 10334433142131 |
6 | 351310333405 |
7 | 46563022412 |
oct | 12364013755 |
9 | 3558818375 |
10 | 1406146541 |
11 | 661807788 |
12 | 332aba265 |
13 | 195421397 |
14 | d4a72109 |
15 | 836ab02b |
hex | 53d017ed |
1406146541 has 2 divisors, whose sum is σ = 1406146542. Its totient is φ = 1406146540.
The previous prime is 1406146531. The next prime is 1406146591. The reversal of 1406146541 is 1456416041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 971257225 + 434889316 = 31165^2 + 20854^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1406146541 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1406146498 and 1406146507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1406146531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 703073270 + 703073271.
It is an arithmetic number, because the mean of its divisors is an integer number (703073271).
Almost surely, 21406146541 is an apocalyptic number.
It is an amenable number.
1406146541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1406146541 is an equidigital number, since it uses as much as digits as its factorization.
1406146541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 1406146541 is about 37498.6205212938. The cubic root of 1406146541 is about 1120.3237109045.
The spelling of 1406146541 in words is "one billion, four hundred six million, one hundred forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •