Base | Representation |
---|---|
bin | 100011000100100001101… |
… | …101000011111111011101 |
3 | 22112101201222102110122112 |
4 | 203010201231003333131 |
5 | 303441231240122023 |
6 | 5043054050323405 |
7 | 336056042652302 |
oct | 43044155037735 |
9 | 8471658373575 |
10 | 2410042114013 |
11 | 84a102a42066 |
12 | 32b0ba289565 |
13 | 14635c5169c1 |
14 | 8490a6190a9 |
15 | 42a56302478 |
hex | 23121b43fdd |
2410042114013 has 2 divisors, whose sum is σ = 2410042114014. Its totient is φ = 2410042114012.
The previous prime is 2410042113979. The next prime is 2410042114049. The reversal of 2410042114013 is 3104112400142.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1500044406169 + 909997707844 = 1224763^2 + 953938^2 .
It is a cyclic number.
It is not a de Polignac number, because 2410042114013 - 214 = 2410042097629 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2410042114013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2410042114063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1205021057006 + 1205021057007.
It is an arithmetic number, because the mean of its divisors is an integer number (1205021057007).
Almost surely, 22410042114013 is an apocalyptic number.
It is an amenable number.
2410042114013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2410042114013 is an equidigital number, since it uses as much as digits as its factorization.
2410042114013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2410042114013 its reverse (3104112400142), we get a palindrome (5514154514155).
The spelling of 2410042114013 in words is "two trillion, four hundred ten billion, forty-two million, one hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •