Base | Representation |
---|---|
bin | 1010111011001011010010… |
… | …1110001111110101111100 |
3 | 1120112022110020200120102000 |
4 | 2232302310232033311330 |
5 | 3033300041202111022 |
6 | 41314043204102300 |
7 | 2346551424216432 |
oct | 256626456176574 |
9 | 46468406616360 |
10 | 12011760582012 |
11 | 3911182780174 |
12 | 141bb62394990 |
13 | 691920078459 |
14 | 2d752d8b6d52 |
15 | 15c6c064c6ac |
hex | aecb4b8fd7c |
12011760582012 has 24 divisors (see below), whose sum is σ = 31141601509200. Its totient is φ = 4003920193968.
The previous prime is 12011760581969. The next prime is 12011760582023. The reversal of 12011760582012 is 21028506711021.
It is a happy number.
12011760582012 is a `hidden beast` number, since 1 + 2 + 0 + 1 + 1 + 7 + 60 + 582 + 0 + 12 = 666.
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 polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55610002587 + ... + 55610002802.
It is an arithmetic number, because the mean of its divisors is an integer number (1297566729550).
Almost surely, 212011760582012 is an apocalyptic number.
12011760582012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12011760582012 is an abundant number, since it is smaller than the sum of its proper divisors (19129840927188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011760582012 is a wasteful number, since it uses less digits than its factorization.
12011760582012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111220005402 (or 111220005394 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 36.
The spelling of 12011760582012 in words is "twelve trillion, eleven billion, seven hundred sixty million, five hundred eighty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •