Base | Representation |
---|---|
bin | 10011100001110000000… |
… | …101100010011100010101 |
3 | 11202021201000222002122222 |
4 | 103201300011202130111 |
5 | 133441213013440331 |
6 | 2504244242432125 |
7 | 165643534214306 |
oct | 23416005423425 |
9 | 4667630862588 |
10 | 1341910296341 |
11 | 47811241913a |
12 | 1980a3062645 |
13 | 99706b76c64 |
14 | 48d3d7407ad |
15 | 24d8d4a0b7b |
hex | 13870162715 |
1341910296341 has 8 divisors (see below), whose sum is σ = 1354356855744. Its totient is φ = 1329473759040.
The previous prime is 1341910296313. The next prime is 1341910296383. The reversal of 1341910296341 is 1436920191431.
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 1341910296341 - 234 = 1324730427157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1341910296292 and 1341910296301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1341910296301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2236361 + ... + 2772206.
It is an arithmetic number, because the mean of its divisors is an integer number (169294606968).
Almost surely, 21341910296341 is an apocalyptic number.
It is an amenable number.
1341910296341 is a deficient number, since it is larger than the sum of its proper divisors (12446559403).
1341910296341 is a wasteful number, since it uses less digits than its factorization.
1341910296341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5011051.
The product of its (nonzero) digits is 139968, while the sum is 44.
The spelling of 1341910296341 in words is "one trillion, three hundred forty-one billion, nine hundred ten million, two hundred ninety-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •