Base | Representation |
---|---|
bin | 10011000000011010010… |
… | …100011100001101111000 |
3 | 11121212022011110010022200 |
4 | 103000122110130031320 |
5 | 132344404033432211 |
6 | 2440004104550200 |
7 | 163235443424331 |
oct | 23003224341570 |
9 | 4555264403280 |
10 | 1306111624056 |
11 | 463a11a63868 |
12 | 191172182360 |
13 | 96220346835 |
14 | 47305133288 |
15 | 23e9575bb56 |
hex | 1301a51c378 |
1306111624056 has 96 divisors (see below), whose sum is σ = 3685691646000. Its totient is φ = 417333514752.
The previous prime is 1306111624049. The next prime is 1306111624099. The reversal of 1306111624056 is 6504261116031.
1306111624056 is a `hidden beast` number, since 1 + 3 + 0 + 611 + 16 + 24 + 0 + 5 + 6 = 666.
It is a super-2 number, since 2×13061116240562 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1306111624056.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1959885 + ... + 2540348.
Almost surely, 21306111624056 is an apocalyptic number.
It is an amenable number.
1306111624056 is an abundant number, since it is smaller than the sum of its proper divisors (2379580021944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1306111624056 is a wasteful number, since it uses less digits than its factorization.
1306111624056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4500413 (or 4500406 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 1306111624056 in words is "one trillion, three hundred six billion, one hundred eleven million, six hundred twenty-four thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •