Base | Representation |
---|---|
bin | 1000111110111000… |
… | …0111001100111101 |
3 | 20020001011011202022 |
4 | 2033232013030331 |
5 | 14414233330023 |
6 | 1035133005525 |
7 | 113516055053 |
oct | 21756071475 |
9 | 6201134668 |
10 | 2411230013 |
11 | 1028092885 |
12 | 5736238a5 |
13 | 2c571b32a |
14 | 18c3441d3 |
15 | e1a437c8 |
hex | 8fb8733d |
2411230013 has 2 divisors, whose sum is σ = 2411230014. Its totient is φ = 2411230012.
The previous prime is 2411230009. The next prime is 2411230033. The reversal of 2411230013 is 3100321142.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1762152484 + 649077529 = 41978^2 + 25477^2 .
It is a cyclic number.
It is not a de Polignac number, because 2411230013 - 22 = 2411230009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2411229973 and 2411230000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2411230033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1205615006 + 1205615007.
It is an arithmetic number, because the mean of its divisors is an integer number (1205615007).
Almost surely, 22411230013 is an apocalyptic number.
It is an amenable number.
2411230013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2411230013 is an equidigital number, since it uses as much as digits as its factorization.
2411230013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2411230013 is about 49104.2769318519. The cubic root of 2411230013 is about 1340.9509128081.
Adding to 2411230013 its reverse (3100321142), we get a palindrome (5511551155).
The spelling of 2411230013 in words is "two billion, four hundred eleven million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •