Base | Representation |
---|---|
bin | 10110110101000111… |
… | …10111010100100000 |
3 | 1011122012021101121222 |
4 | 23122203313110200 |
5 | 200100213104222 |
6 | 5344121034212 |
7 | 612506551214 |
oct | 133243672440 |
9 | 34565241558 |
10 | 12256769312 |
11 | 521a699217 |
12 | 2460925968 |
13 | 1204407428 |
14 | 843b7a944 |
15 | 4bb090542 |
hex | 2da8f7520 |
12256769312 has 18 divisors (see below), whose sum is σ = 24131747619. Its totient is φ = 6128071520.
The previous prime is 12256769311. The next prime is 12256769333. The reversal of 12256769312 is 21396765221.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
12256769312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6128384656 + 6128384656 = 78284^2 + 78284^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=78284.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12256769311) 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 2 ways as a sum of consecutive naturals, for example, 616487 + ... + 636057.
Almost surely, 212256769312 is an apocalyptic number.
It is an amenable number.
12256769312 is a deficient number, since it is larger than the sum of its proper divisors (11874978307).
12256769312 is an frugal number, since it uses more digits than its factorization.
12256769312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39152 (or 19573 counting only the distinct ones).
The product of its digits is 272160, while the sum is 44.
The spelling of 12256769312 in words is "twelve billion, two hundred fifty-six million, seven hundred sixty-nine thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •