Base | Representation |
---|---|
bin | 11101100000111100111… |
… | …01110011011100101001 |
3 | 10120221122000010001110021 |
4 | 32300132131303130221 |
5 | 113103411043124431 |
6 | 2053514252120441 |
7 | 133160631524053 |
oct | 16603635633451 |
9 | 3527560101407 |
10 | 1014123411241 |
11 | 3610a6255896 |
12 | 144663a66121 |
13 | 74829327205 |
14 | 371260868d3 |
15 | 1b5a6625b11 |
hex | ec1e773729 |
1014123411241 has 4 divisors (see below), whose sum is σ = 1014794573184. Its totient is φ = 1013452249300.
The previous prime is 1014123411233. The next prime is 1014123411247. The reversal of 1014123411241 is 1421143214101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1014123411241 - 23 = 1014123411233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1014123411247) 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 in 3 ways as a sum of consecutive naturals, for example, 335578705 + ... + 335581726.
It is an arithmetic number, because the mean of its divisors is an integer number (253698643296).
Almost surely, 21014123411241 is an apocalyptic number.
It is an amenable number.
1014123411241 is a deficient number, since it is larger than the sum of its proper divisors (671161943).
1014123411241 is an equidigital number, since it uses as much as digits as its factorization.
1014123411241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671161942.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1014123411241 its reverse (1421143214101), we get a palindrome (2435266625342).
The spelling of 1014123411241 in words is "one trillion, fourteen billion, one hundred twenty-three million, four hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •