Base | Representation |
---|---|
bin | 10100100001011000010… |
… | …000100111011111001101 |
3 | 11222211001100120212101212 |
4 | 110201120100213133031 |
5 | 141101122341233031 |
6 | 2555503431344205 |
7 | 203612546265221 |
oct | 24413020473715 |
9 | 4884040525355 |
10 | 1410230024141 |
11 | 4a40910a18a4 |
12 | 1a938b222065 |
13 | a2ca41615b3 |
14 | 4c381128781 |
15 | 26a3b30812b |
hex | 148584277cd |
1410230024141 has 8 divisors (see below), whose sum is σ = 1434158751840. Its totient is φ = 1386302180688.
The previous prime is 1410230024101. The next prime is 1410230024173. The reversal of 1410230024141 is 1414200320141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1410230024141 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 (1410230024101) 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 7 ways as a sum of consecutive naturals, for example, 3531455 + ... + 3910451.
It is an arithmetic number, because the mean of its divisors is an integer number (179269843980).
Almost surely, 21410230024141 is an apocalyptic number.
It is an amenable number.
1410230024141 is a deficient number, since it is larger than the sum of its proper divisors (23928727699).
1410230024141 is an equidigital number, since it uses as much as digits as its factorization.
1410230024141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442123.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1410230024141 its reverse (1414200320141), we get a palindrome (2824430344282).
The spelling of 1410230024141 in words is "one trillion, four hundred ten billion, two hundred thirty million, twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •