Base | Representation |
---|---|
bin | 10100110111100111001… |
… | …101010101001100010101 |
3 | 12002002200010001212100101 |
4 | 110313213031111030111 |
5 | 141444020401004031 |
6 | 3014452355214101 |
7 | 205416261366346 |
oct | 24674715251425 |
9 | 5062603055311 |
10 | 1434103141141 |
11 | 503221921a60 |
12 | 1b1b322a7331 |
13 | a530a093b28 |
14 | 4d5a79760cd |
15 | 274870d4361 |
hex | 14de7355315 |
1434103141141 has 8 divisors (see below), whose sum is σ = 1571368122144. Its totient is φ = 1297986821520.
The previous prime is 1434103141127. The next prime is 1434103141147. The reversal of 1434103141141 is 1411413014341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1434103141141 - 219 = 1434102616853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434103141147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 287162730 + ... + 287167723.
It is an arithmetic number, because the mean of its divisors is an integer number (196421015268).
Almost surely, 21434103141141 is an apocalyptic number.
1434103141141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1434103141141 is a deficient number, since it is larger than the sum of its proper divisors (137264981003).
1434103141141 is a wasteful number, since it uses less digits than its factorization.
1434103141141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 574330691.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 1434103141141 its reverse (1411413014341), we get a palindrome (2845516155482).
The spelling of 1434103141141 in words is "one trillion, four hundred thirty-four billion, one hundred three million, one hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •