Base | Representation |
---|---|
bin | 11000001010000010… |
… | …01011011011011001 |
3 | 1020110211122101102000 |
4 | 30011001023123121 |
5 | 203030042100141 |
6 | 5542524431213 |
7 | 636246335124 |
oct | 140501133331 |
9 | 36424571360 |
10 | 12969096921 |
11 | 5555798520 |
12 | 261b3a8509 |
13 | 12b8b71961 |
14 | 8b06033bb |
15 | 50d89a5b6 |
hex | 30504b6d9 |
12969096921 has 96 divisors (see below), whose sum is σ = 21784412160. Its totient is φ = 7562030400.
The previous prime is 12969096913. The next prime is 12969096929.
12969096921 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (12969096913) and next prime (12969096929).
It is not a de Polignac number, because 12969096921 - 23 = 12969096913 is a prime.
It is a super-3 number, since 3×129690969213 (a number of 31 digits) contains 333 as substring.
It is an alternating number because its digits alternate between odd and even.
It is not an unprimeable number, because it can be changed into a prime (12969096929) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 67900936 + ... + 67901126.
It is an arithmetic number, because the mean of its divisors is an integer number (226920960).
Almost surely, 212969096921 is an apocalyptic number.
12969096921 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12969096921 is a deficient number, since it is larger than the sum of its proper divisors (8815315239).
12969096921 is a wasteful number, since it uses less digits than its factorization.
12969096921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452 (or 409 counting only the distinct ones).
The product of its (nonzero) digits is 944784, while the sum is 54.
The spelling of 12969096921 in words is "twelve billion, nine hundred sixty-nine million, ninety-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •