Base | Representation |
---|---|
bin | 10011100001000101110… |
… | …001001010111101100101 |
3 | 11202012212120000021021121 |
4 | 103201011301022331211 |
5 | 133433234240023323 |
6 | 2504050001213541 |
7 | 165620123366464 |
oct | 23410561127545 |
9 | 4665776007247 |
10 | 1341200314213 |
11 | 477888681051 |
12 | 197b253312b1 |
13 | 99622a511a6 |
14 | 48cb33289db |
15 | 24d4aeaaa5d |
hex | 13845c4af65 |
1341200314213 has 8 divisors (see below), whose sum is σ = 1387475468280. Its totient is φ = 1294926951360.
The previous prime is 1341200314189. The next prime is 1341200314229. The reversal of 1341200314213 is 3124130021431.
It can be written as a sum of positive squares in 4 ways, for example, as 156200429284 + 1184999884929 = 395222^2 + 1088577^2 .
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 1341200314213 - 233 = 1332610379621 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 (1341206314213) 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, 1175331 + ... + 2015887.
It is an arithmetic number, because the mean of its divisors is an integer number (173434433535).
Almost surely, 21341200314213 is an apocalyptic number.
It is an amenable number.
1341200314213 is a deficient number, since it is larger than the sum of its proper divisors (46275154067).
1341200314213 is an equidigital number, since it uses as much as digits as its factorization.
1341200314213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 895607.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1341200314213 its reverse (3124130021431), we get a palindrome (4465330335644).
The spelling of 1341200314213 in words is "one trillion, three hundred forty-one billion, two hundred million, three hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •