Base | Representation |
---|---|
bin | 11000000001010110… |
… | …10111010100000001 |
3 | 1020021202121101001200 |
4 | 30000223113110001 |
5 | 202402421111234 |
6 | 5531403451413 |
7 | 634403324361 |
oct | 140053272401 |
9 | 36252541050 |
10 | 12896269569 |
11 | 5518676227 |
12 | 25bab26b69 |
13 | 12a6a53251 |
14 | 8a4a869a1 |
15 | 5072b1d99 |
hex | 300ad7501 |
12896269569 has 6 divisors (see below), whose sum is σ = 18627944946. Its totient is φ = 8597513040.
The previous prime is 12896269567. The next prime is 12896269577. The reversal of 12896269569 is 96596269821.
12896269569 is a `hidden beast` number, since 1 + 2 + 8 + 9 + 6 + 2 + 69 + 569 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10386259569 + 2510010000 = 101913^2 + 50100^2 .
It is not a de Polignac number, because 12896269569 - 21 = 12896269567 is a prime.
It is a super-2 number, since 2×128962695692 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12896269567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 716459412 + ... + 716459429.
It is an arithmetic number, because the mean of its divisors is an integer number (3104657491).
Almost surely, 212896269569 is an apocalyptic number.
It is an amenable number.
12896269569 is a deficient number, since it is larger than the sum of its proper divisors (5731675377).
12896269569 is a wasteful number, since it uses less digits than its factorization.
12896269569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1432918847 (or 1432918844 counting only the distinct ones).
The product of its digits is 25194240, while the sum is 63.
The spelling of 12896269569 in words is "twelve billion, eight hundred ninety-six million, two hundred sixty-nine thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •