Base | Representation |
---|---|
bin | 1011111010110101011100… |
… | …0010101001000010111101 |
3 | 1201101212100020121021002011 |
4 | 2332231113002221002331 |
5 | 3204204332303432201 |
6 | 43512312402531221 |
7 | 2521556111001430 |
oct | 276552702510275 |
9 | 51355306537064 |
10 | 13105405530301 |
11 | 41a2a75845807 |
12 | 1577ab9966b11 |
13 | 740ab03532a6 |
14 | 33443ad4b817 |
15 | 17ad7d230151 |
hex | beb570a90bd |
13105405530301 has 8 divisors (see below), whose sum is σ = 14982776383680. Its totient is φ = 11229327192768.
The previous prime is 13105405530247. The next prime is 13105405530311. The reversal of 13105405530301 is 10303550450131.
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 13105405530301 - 213 = 13105405522109 is a prime.
It is a super-2 number, since 2×131054055303012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13105405530311) 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, 323107231 + ... + 323147788.
It is an arithmetic number, because the mean of its divisors is an integer number (1872847047960).
Almost surely, 213105405530301 is an apocalyptic number.
It is an amenable number.
13105405530301 is a deficient number, since it is larger than the sum of its proper divisors (1877370853379).
13105405530301 is an equidigital number, since it uses as much as digits as its factorization.
13105405530301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 646257923.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 13105405530301 its reverse (10303550450131), we get a palindrome (23408955980432).
The spelling of 13105405530301 in words is "thirteen trillion, one hundred five billion, four hundred five million, five hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •