Base | Representation |
---|---|
bin | 10100100101000111110… |
… | …010000011100101100101 |
3 | 12000012102102010212011102 |
4 | 110211013302003211211 |
5 | 141132340111411423 |
6 | 3001410302245445 |
7 | 204114253166312 |
oct | 24450762034545 |
9 | 5005372125142 |
10 | 1414248544613 |
11 | 4a58634857a3 |
12 | 1aa110b86885 |
13 | a3494868b68 |
14 | 4c642addd09 |
15 | 26bc3edac28 |
hex | 14947c83965 |
1414248544613 has 4 divisors (see below), whose sum is σ = 1488682678560. Its totient is φ = 1339814410668.
The previous prime is 1414248544601. The next prime is 1414248544669. The reversal of 1414248544613 is 3164458424141.
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 1414248544613 - 230 = 1413174802789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414248544693) 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 in 3 ways as a sum of consecutive naturals, for example, 37217066945 + ... + 37217066982.
It is an arithmetic number, because the mean of its divisors is an integer number (372170669640).
Almost surely, 21414248544613 is an apocalyptic number.
It is an amenable number.
1414248544613 is a deficient number, since it is larger than the sum of its proper divisors (74434133947).
1414248544613 is an equidigital number, since it uses as much as digits as its factorization.
1414248544613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74434133946.
The product of its digits is 1474560, while the sum is 47.
The spelling of 1414248544613 in words is "one trillion, four hundred fourteen billion, two hundred forty-eight million, five hundred forty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.020 sec. • engine limits •