Base | Representation |
---|---|
bin | 10011100001010001101… |
… | …110110011101111100101 |
3 | 11202020101112200020210121 |
4 | 103201101232303233211 |
5 | 133434142130141123 |
6 | 2504121531121541 |
7 | 165625111360615 |
oct | 23412156635745 |
9 | 4666345606717 |
10 | 1341401021413 |
11 | 4779809a7372 |
12 | 197b805a32b1 |
13 | 996554c534b |
14 | 48cd1c52a45 |
15 | 24d5d90475d |
hex | 13851bb3be5 |
1341401021413 has 8 divisors (see below), whose sum is σ = 1372642752096. Its totient is φ = 1310161398000.
The previous prime is 1341401021399. The next prime is 1341401021449. The reversal of 1341401021413 is 3141201041431.
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 1341401021413 - 25 = 1341401021381 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 (1341401021453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 799563 + ... + 1822663.
It is an arithmetic number, because the mean of its divisors is an integer number (171580344012).
Almost surely, 21341401021413 is an apocalyptic number.
It is an amenable number.
1341401021413 is a deficient number, since it is larger than the sum of its proper divisors (31241730683).
1341401021413 is a wasteful number, since it uses less digits than its factorization.
1341401021413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053635.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1341401021413 its reverse (3141201041431), we get a palindrome (4482602062844).
The spelling of 1341401021413 in words is "one trillion, three hundred forty-one billion, four hundred one million, twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •