Base | Representation |
---|---|
bin | 11000001101001011… |
… | …00010001011000001 |
3 | 1020112200010221121002 |
4 | 30012211202023001 |
5 | 203103310420411 |
6 | 5545304341345 |
7 | 640016054423 |
oct | 140645421301 |
9 | 36480127532 |
10 | 12995404481 |
11 | 5569626804 |
12 | 2628174855 |
13 | 12c1453067 |
14 | 8b3cd0813 |
15 | 510d4533b |
hex | 3069622c1 |
12995404481 has 4 divisors (see below), whose sum is σ = 13032219012. Its totient is φ = 12958589952.
The previous prime is 12995404459. The next prime is 12995404511. The reversal of 12995404481 is 18440459921.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5057485456 + 7937919025 = 71116^2 + 89095^2 .
It is a cyclic number.
It is not a de Polignac number, because 12995404481 - 214 = 12995388097 is a prime.
It is a super-2 number, since 2×129954044812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12995404421) 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 3 ways as a sum of consecutive naturals, for example, 18406736 + ... + 18407441.
It is an arithmetic number, because the mean of its divisors is an integer number (3258054753).
Almost surely, 212995404481 is an apocalyptic number.
It is an amenable number.
12995404481 is a deficient number, since it is larger than the sum of its proper divisors (36814531).
12995404481 is an equidigital number, since it uses as much as digits as its factorization.
12995404481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36814530.
The product of its (nonzero) digits is 414720, while the sum is 47.
The spelling of 12995404481 in words is "twelve billion, nine hundred ninety-five million, four hundred four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •