Base | Representation |
---|---|
bin | 10111010111000001… |
… | …11011111011010101 |
3 | 1012101000111200222000 |
4 | 23223200323323111 |
5 | 201141022330141 |
6 | 5432241425513 |
7 | 622532364231 |
oct | 135340737325 |
9 | 35330450860 |
10 | 12541214421 |
11 | 535620901a |
12 | 252003b299 |
13 | 124b31a148 |
14 | 86d8615c1 |
15 | 4d602a5b6 |
hex | 2eb83bed5 |
12541214421 has 8 divisors (see below), whose sum is σ = 18579576960. Its totient is φ = 8360809596.
The previous prime is 12541214383. The next prime is 12541214429. The reversal of 12541214421 is 12441214521.
12541214421 is a `hidden beast` number, since 1 + 25 + 4 + 1 + 214 + 421 = 666.
It is not a de Polignac number, because 12541214421 - 213 = 12541206229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 464489423 = 12541214421 / (1 + 2 + 5 + 4 + 1 + 2 + 1 + 4 + 4 + 2 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12541214429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232244685 + ... + 232244738.
It is an arithmetic number, because the mean of its divisors is an integer number (2322447120).
Almost surely, 212541214421 is an apocalyptic number.
It is an amenable number.
12541214421 is a deficient number, since it is larger than the sum of its proper divisors (6038362539).
12541214421 is an equidigital number, since it uses as much as digits as its factorization.
12541214421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464489432 (or 464489426 counting only the distinct ones).
The product of its digits is 2560, while the sum is 27.
Adding to 12541214421 its reverse (12441214521), we get a palindrome (24982428942).
The spelling of 12541214421 in words is "twelve billion, five hundred forty-one million, two hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •