Base | Representation |
---|---|
bin | 10111010011011100… |
… | …00101011010111100 |
3 | 1012021220212002000000 |
4 | 23221232011122330 |
5 | 201110320403443 |
6 | 5425244234300 |
7 | 622015436610 |
oct | 135156053274 |
9 | 35256762000 |
10 | 12511106748 |
11 | 5340214748 |
12 | 2511b3b990 |
13 | 124500815a |
14 | 869865340 |
15 | 4d357e8d3 |
hex | 2e9b856bc |
12511106748 has 84 divisors (see below), whose sum is σ = 37516219440. Its totient is φ = 3574596096.
The previous prime is 12511106723. The next prime is 12511106761. The reversal of 12511106748 is 84760111521.
It is a tau number, because it is divible by the number of its divisors (84).
It is a super-2 number, since 2×125111067482 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 27 ways as a sum of consecutive naturals, for example, 286053 + ... + 326876.
It is an arithmetic number, because the mean of its divisors is an integer number (446621660).
Almost surely, 212511106748 is an apocalyptic number.
12511106748 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12511106748 is an abundant number, since it is smaller than the sum of its proper divisors (25005112692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12511106748 is an equidigital number, since it uses as much as digits as its factorization.
12511106748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612958 (or 612941 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 36.
The spelling of 12511106748 in words is "twelve billion, five hundred eleven million, one hundred six thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •