Base | Representation |
---|---|
bin | 1011111100111010000111… |
… | …1101001001110111010000 |
3 | 1201112021021102111120000201 |
4 | 2333032201331021313100 |
5 | 3210300303130341144 |
6 | 43540522514024544 |
7 | 2524256531014501 |
oct | 277164175116720 |
9 | 51467242446021 |
10 | 13141022121424 |
11 | 420709244688a |
12 | 1582999878154 |
13 | 744268231492 |
14 | 3360592bcba8 |
15 | 17bc64ea91d4 |
hex | bf3a1f49dd0 |
13141022121424 has 80 divisors (see below), whose sum is σ = 26918525354112. Its totient is φ = 6202023151104.
The previous prime is 13141022121413. The next prime is 13141022121439. The reversal of 13141022121424 is 42412122014131.
It is a junction number, because it is equal to n+sod(n) for n = 13141022121392 and 13141022121401.
It is a congruent number.
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, 26541802 + ... + 27032374.
Almost surely, 213141022121424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13141022121424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13459262677056).
13141022121424 is an abundant number, since it is smaller than the sum of its proper divisors (13777503232688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13141022121424 is a wasteful number, since it uses less digits than its factorization.
13141022121424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491564 (or 491558 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 13141022121424 its reverse (42412122014131), we get a palindrome (55553144135555).
The spelling of 13141022121424 in words is "thirteen trillion, one hundred forty-one billion, twenty-two million, one hundred twenty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •