Base | Representation |
---|---|
bin | 1011111010100010011101… |
… | …1000101000011100011101 |
3 | 1201101101012012101101121010 |
4 | 2332220213120220130131 |
5 | 3204113414110140331 |
6 | 43510111053525433 |
7 | 2521315630251555 |
oct | 276504730503435 |
9 | 51341165341533 |
10 | 13100311021341 |
11 | 41a08a1057825 |
12 | 1576b177a3879 |
13 | 74047aa5434b |
14 | 3340b64c8165 |
15 | 17ab80d5ae46 |
hex | bea2762871d |
13100311021341 has 8 divisors (see below), whose sum is σ = 17467116768864. Its totient is φ = 8733522977360.
The previous prime is 13100311021321. The next prime is 13100311021351. The reversal of 13100311021341 is 14312011300131.
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 13100311021341 - 26 = 13100311021277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100311021321) 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, 2590530 + ... + 5736851.
It is an arithmetic number, because the mean of its divisors is an integer number (2183389596108).
Almost surely, 213100311021341 is an apocalyptic number.
It is an amenable number.
13100311021341 is a deficient number, since it is larger than the sum of its proper divisors (4366805747523).
13100311021341 is an equidigital number, since it uses as much as digits as its factorization.
13100311021341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8851771.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13100311021341 its reverse (14312011300131), we get a palindrome (27412322321472).
The spelling of 13100311021341 in words is "thirteen trillion, one hundred billion, three hundred eleven million, twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •