Base | Representation |
---|---|
bin | 1011011010100111100010… |
… | …1111000100111001011000 |
3 | 1122102221200220000102010220 |
4 | 2312221320233010321120 |
5 | 3121122313012430111 |
6 | 42410134504040040 |
7 | 2433563165003355 |
oct | 266517057047130 |
9 | 48387626012126 |
10 | 12551920045656 |
11 | 3aaa26a702042 |
12 | 14a8790763020 |
13 | 70084430c064 |
14 | 31573253762c |
15 | 16b786c65e06 |
hex | b6a78bc4e58 |
12551920045656 has 64 divisors (see below), whose sum is σ = 33033103084800. Its totient is φ = 3963556080000.
The previous prime is 12551920045603. The next prime is 12551920045699. The reversal of 12551920045656 is 65654002915521.
It is a super-2 number, since 2×125519200456562 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12551920045599 and 12551920045608.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8088181 + ... + 9514331.
It is an arithmetic number, because the mean of its divisors is an integer number (516142235700).
Almost surely, 212551920045656 is an apocalyptic number.
It is an amenable number.
12551920045656 is an abundant number, since it is smaller than the sum of its proper divisors (20481183039144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12551920045656 is a wasteful number, since it uses less digits than its factorization.
12551920045656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1445480 (or 1445476 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 51.
The spelling of 12551920045656 in words is "twelve trillion, five hundred fifty-one billion, nine hundred twenty million, forty-five thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •