Base | Representation |
---|---|
bin | 1011011001011000010111… |
… | …0010010000100001101010 |
3 | 1122100220211112021212212222 |
4 | 2312112011302100201222 |
5 | 3120300300010201200 |
6 | 42352301352234042 |
7 | 2432211352565450 |
oct | 266260562204152 |
9 | 48326745255788 |
10 | 12530664147050 |
11 | 3aa1252267895 |
12 | 14a463a09b922 |
13 | 6cb83769aa6a |
14 | 3146b75309d0 |
15 | 16ae40b1bd85 |
hex | b6585c9086a |
12530664147050 has 48 divisors (see below), whose sum is σ = 26694392199552. Its totient is φ = 4286908286400.
The previous prime is 12530664147047. The next prime is 12530664147059. The reversal of 12530664147050 is 5074146603521.
It is a junction number, because it is equal to n+sod(n) for n = 12530664146992 and 12530664147010.
It is not an unprimeable number, because it can be changed into a prime (12530664147059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38669342 + ... + 38992041.
It is an arithmetic number, because the mean of its divisors is an integer number (556133170824).
Almost surely, 212530664147050 is an apocalyptic number.
12530664147050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12530664147050 is an abundant number, since it is smaller than the sum of its proper divisors (14163728052502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12530664147050 is a wasteful number, since it uses less digits than its factorization.
12530664147050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77661863 (or 77661858 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 44.
The spelling of 12530664147050 in words is "twelve trillion, five hundred thirty billion, six hundred sixty-four million, one hundred forty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •