Base | Representation |
---|---|
bin | 111001111001101001… |
… | …1110001100010010101 |
3 | 102212221112202221021101 |
4 | 1303303103301202111 |
5 | 4014122312201123 |
6 | 133042125550101 |
7 | 11661201115132 |
oct | 1636323614225 |
9 | 385845687241 |
10 | 124341131413 |
11 | 48807366434 |
12 | 20121715331 |
13 | b9576a8395 |
14 | 6037ad9589 |
15 | 337b161aad |
hex | 1cf34f1895 |
124341131413 has 2 divisors, whose sum is σ = 124341131414. Its totient is φ = 124341131412.
The previous prime is 124341131407. The next prime is 124341131419. The reversal of 124341131413 is 314131143421.
It is a balanced prime because it is at equal distance from previous prime (124341131407) and next prime (124341131419).
It can be written as a sum of positive squares in only one way, i.e., 65003581764 + 59337549649 = 254958^2 + 243593^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-124341131413 is a prime.
It is a super-2 number, since 2×1243411314132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124341131419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62170565706 + 62170565707.
It is an arithmetic number, because the mean of its divisors is an integer number (62170565707).
Almost surely, 2124341131413 is an apocalyptic number.
It is an amenable number.
124341131413 is a deficient number, since it is larger than the sum of its proper divisors (1).
124341131413 is an equidigital number, since it uses as much as digits as its factorization.
124341131413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3456, while the sum is 28.
Adding to 124341131413 its reverse (314131143421), we get a palindrome (438472274834).
The spelling of 124341131413 in words is "one hundred twenty-four billion, three hundred forty-one million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •