Base | Representation |
---|---|
bin | 1001011110001011100011… |
… | …0010101010001011110101 |
3 | 1100212120121121100022111201 |
4 | 2113202320302222023311 |
5 | 2331111034324410422 |
6 | 34052101050532501 |
7 | 2123252063026135 |
oct | 227427062521365 |
9 | 40776547308451 |
10 | 10414101013237 |
11 | 3355660588369 |
12 | 12023a5437131 |
13 | 5a7078cb247c |
14 | 28008bd80ac5 |
15 | 130d64774727 |
hex | 978b8caa2f5 |
10414101013237 has 2 divisors, whose sum is σ = 10414101013238. Its totient is φ = 10414101013236.
The previous prime is 10414101013207. The next prime is 10414101013249. The reversal of 10414101013237 is 73231010141401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7440014514321 + 2974086498916 = 2727639^2 + 1724554^2 .
It is a cyclic number.
It is not a de Polignac number, because 10414101013237 - 239 = 9864345199349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10414101013207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5207050506618 + 5207050506619.
It is an arithmetic number, because the mean of its divisors is an integer number (5207050506619).
Almost surely, 210414101013237 is an apocalyptic number.
It is an amenable number.
10414101013237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10414101013237 is an equidigital number, since it uses as much as digits as its factorization.
10414101013237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 10414101013237 its reverse (73231010141401), we get a palindrome (83645111154638).
The spelling of 10414101013237 in words is "ten trillion, four hundred fourteen billion, one hundred one million, thirteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •