Base | Representation |
---|---|
bin | 1011111011110000011011… |
… | …1011101110110111001100 |
3 | 1201110101012212121100112212 |
4 | 2332330012323232313030 |
5 | 3204434300300123040 |
6 | 43523452020445552 |
7 | 2522656410525041 |
oct | 276740673566714 |
9 | 51411185540485 |
10 | 13121241411020 |
11 | 41a9761785336 |
12 | 157ab992498b8 |
13 | 742435105b02 |
14 | 33510019b1c8 |
15 | 17b4a8607d65 |
hex | bef06eeedcc |
13121241411020 has 48 divisors (see below), whose sum is σ = 30181516777440. Its totient is φ = 4769424866304.
The previous prime is 13121241411011. The next prime is 13121241411041. The reversal of 13121241411020 is 2011414212131.
It is a super-3 number, since 3×131212414110203 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 665367494 + ... + 665387213.
It is an arithmetic number, because the mean of its divisors is an integer number (628781599530).
Almost surely, 213121241411020 is an apocalyptic number.
13121241411020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13121241411020 is an abundant number, since it is smaller than the sum of its proper divisors (17060275366420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121241411020 is a wasteful number, since it uses less digits than its factorization.
13121241411020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1330754762 (or 1330754760 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 13121241411020 its reverse (2011414212131), we get a palindrome (15132655623151).
The spelling of 13121241411020 in words is "thirteen trillion, one hundred twenty-one billion, two hundred forty-one million, four hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •