Base | Representation |
---|---|
bin | 1011100111011110111100… |
… | …0011100111101001111000 |
3 | 1200020002012201222222000210 |
4 | 2321313233003213221320 |
5 | 3133232444302140423 |
6 | 43055451142231120 |
7 | 2455546366441146 |
oct | 271675703475170 |
9 | 50202181888023 |
10 | 12772948474488 |
11 | 4084a82473044 |
12 | 15235967254a0 |
13 | 71863a0b7b17 |
14 | 3222dd32c596 |
15 | 1723c13a0b93 |
hex | b9def0e7a78 |
12772948474488 has 128 divisors (see below), whose sum is σ = 33888134592000. Its totient is φ = 3998036398080.
The previous prime is 12772948474487. The next prime is 12772948474493. The reversal of 12772948474488 is 88447484927721.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12772948474487) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 393712348 + ... + 393744788.
It is an arithmetic number, because the mean of its divisors is an integer number (264751051500).
Almost surely, 212772948474488 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12772948474488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16944067296000).
12772948474488 is an abundant number, since it is smaller than the sum of its proper divisors (21115186117512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12772948474488 is a wasteful number, since it uses less digits than its factorization.
12772948474488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34645 (or 34641 counting only the distinct ones).
The product of its digits is 1618477056, while the sum is 75.
The spelling of 12772948474488 in words is "twelve trillion, seven hundred seventy-two billion, nine hundred forty-eight million, four hundred seventy-four thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •