Base | Representation |
---|---|
bin | 10111110011011010… |
… | …01110000000111000 |
3 | 1012222121112110220110 |
4 | 23321231032000320 |
5 | 202133001042011 |
6 | 5512025024320 |
7 | 631453246611 |
oct | 137155160070 |
9 | 35877473813 |
10 | 12779315256 |
11 | 5468654774 |
12 | 25879250a0 |
13 | 1288754706 |
14 | 893320c08 |
15 | 4ebdadba6 |
hex | 2f9b4e038 |
12779315256 has 64 divisors (see below), whose sum is σ = 33783321600. Its totient is φ = 4021804800.
The previous prime is 12779315251. The next prime is 12779315257. The reversal of 12779315256 is 65251397721.
12779315256 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12779315251) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 178966 + ... + 239973.
It is an arithmetic number, because the mean of its divisors is an integer number (527864400).
Almost surely, 212779315256 is an apocalyptic number.
It is an amenable number.
12779315256 is an abundant number, since it is smaller than the sum of its proper divisors (21004006344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12779315256 is a wasteful number, since it uses less digits than its factorization.
12779315256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419020 (or 419016 counting only the distinct ones).
The product of its digits is 793800, while the sum is 48.
The spelling of 12779315256 in words is "twelve billion, seven hundred seventy-nine million, three hundred fifteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •