Base | Representation |
---|---|
bin | 10100100011010100011… |
… | …110110100001110110101 |
3 | 12000000102121011222000122 |
4 | 110203110132310032311 |
5 | 141114404403334031 |
6 | 3000450321021325 |
7 | 204015313645610 |
oct | 24432436641665 |
9 | 5000377158018 |
10 | 1412314121141 |
11 | 4a4a60558810 |
12 | 1a9871184845 |
13 | a3246b71aa1 |
14 | 4c4dbc35177 |
15 | 26b0e27d47b |
hex | 148d47b43b5 |
1412314121141 has 16 divisors (see below), whose sum is σ = 1762082371968. Its totient is φ = 1099707537600.
The previous prime is 1412314121087. The next prime is 1412314121149. The reversal of 1412314121141 is 1411214132141.
It is not a de Polignac number, because 1412314121141 - 210 = 1412314120117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1412314121141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412314121149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6534410 + ... + 6747083.
It is an arithmetic number, because the mean of its divisors is an integer number (110130148248).
Almost surely, 21412314121141 is an apocalyptic number.
1412314121141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1412314121141 is a deficient number, since it is larger than the sum of its proper divisors (349768250827).
1412314121141 is a wasteful number, since it uses less digits than its factorization.
1412314121141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13282892.
The product of its digits is 768, while the sum is 26.
Adding to 1412314121141 its reverse (1411214132141), we get a palindrome (2823528253282).
The spelling of 1412314121141 in words is "one trillion, four hundred twelve billion, three hundred fourteen million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •