Base | Representation |
---|---|
bin | 10010111110110110010… |
… | …110110001100011011101 |
3 | 11121200222021200010000122 |
4 | 102332312112301203131 |
5 | 132332440213423031 |
6 | 2435125434404325 |
7 | 163146050266133 |
oct | 22766626614335 |
9 | 4550867603018 |
10 | 1304434514141 |
11 | 463231305310 |
12 | 1909845906a5 |
13 | 96013a52cc5 |
14 | 471c64c9753 |
15 | 23de83ca47b |
hex | 12fb65b18dd |
1304434514141 has 8 divisors (see below), whose sum is σ = 1423056608544. Its totient is φ = 1185818609520.
The previous prime is 1304434514137. The next prime is 1304434514161. The reversal of 1304434514141 is 1414154344031.
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 1304434514141 - 22 = 1304434514137 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 (1304434514111) 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, 1101206 + ... + 1954871.
It is an arithmetic number, because the mean of its divisors is an integer number (177882076068).
Almost surely, 21304434514141 is an apocalyptic number.
1304434514141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1304434514141 is a deficient number, since it is larger than the sum of its proper divisors (118622094403).
1304434514141 is a wasteful number, since it uses less digits than its factorization.
1304434514141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3094891.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 1304434514141 its reverse (1414154344031), we get a palindrome (2718588858172).
The spelling of 1304434514141 in words is "one trillion, three hundred four billion, four hundred thirty-four million, five hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •