Base | Representation |
---|---|
bin | 1011111010110101011101… |
… | …1001011111100000100111 |
3 | 1201101212100122212121011021 |
4 | 2332231113121133200213 |
5 | 3204204340322124201 |
6 | 43512313135152011 |
7 | 2521556212630630 |
oct | 276552731374047 |
9 | 51355318777137 |
10 | 13105411520551 |
11 | 41a2a79167329 |
12 | 1577abb975607 |
13 | 740ab166ca0c |
14 | 33443ba6a887 |
15 | 17ad7da14ea1 |
hex | beb5765f827 |
13105411520551 has 8 divisors (see below), whose sum is σ = 14980117413024. Its totient is φ = 11231331689760.
The previous prime is 13105411520479. The next prime is 13105411520603. The reversal of 13105411520551 is 15502511450131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13105411520551 - 29 = 13105411520039 is a prime.
It is a super-2 number, since 2×131054115205512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13105411520951) 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, 156470560 + ... + 156554293.
It is an arithmetic number, because the mean of its divisors is an integer number (1872514676628).
Almost surely, 213105411520551 is an apocalyptic number.
13105411520551 is a deficient number, since it is larger than the sum of its proper divisors (1874705892473).
13105411520551 is an equidigital number, since it uses as much as digits as its factorization.
13105411520551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313030841.
The product of its (nonzero) digits is 15000, while the sum is 34.
Adding to 13105411520551 its reverse (15502511450131), we get a palindrome (28607922970682).
The spelling of 13105411520551 in words is "thirteen trillion, one hundred five billion, four hundred eleven million, five hundred twenty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •