Base | Representation |
---|---|
bin | 110001100100… |
… | …101101001001 |
3 | 220110020100011 |
4 | 301210231021 |
5 | 11311323101 |
6 | 1142311521 |
7 | 215313316 |
oct | 61445511 |
9 | 26406304 |
10 | 12995401 |
11 | 7376701 |
12 | 44285a1 |
13 | 29000b3 |
14 | 1a23d0d |
15 | 121a751 |
hex | c64b49 |
12995401 has 4 divisors (see below), whose sum is σ = 13312404. Its totient is φ = 12678400.
The previous prime is 12995377. The next prime is 12995413. The reversal of 12995401 is 10459921.
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 4579600 + 8415801 = 2140^2 + 2901^2 .
It is a cyclic number.
It is not a de Polignac number, because 12995401 - 25 = 12995369 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12995431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158440 + ... + 158521.
It is an arithmetic number, because the mean of its divisors is an integer number (3328101).
Almost surely, 212995401 is an apocalyptic number.
It is an amenable number.
12995401 is a deficient number, since it is larger than the sum of its proper divisors (317003).
12995401 is an equidigital number, since it uses as much as digits as its factorization.
12995401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317002.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 12995401 is about 3604.9134524979. The cubic root of 12995401 is about 235.1057378396.
The spelling of 12995401 in words is "twelve million, nine hundred ninety-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •