Base | Representation |
---|---|
bin | 10111000111111001… |
… | …10111111000001101 |
3 | 1012001011201210201212 |
4 | 23203330313320031 |
5 | 200411031221031 |
6 | 5411505544205 |
7 | 616431660116 |
oct | 134374677015 |
9 | 35034653655 |
10 | 12414320141 |
11 | 52a0618513 |
12 | 24a5645065 |
13 | 122ac4b182 |
14 | 85aa6d20d |
15 | 4c9d1212b |
hex | 2e3f37e0d |
12414320141 has 4 divisors (see below), whose sum is σ = 12460470300. Its totient is φ = 12368169984.
The previous prime is 12414320129. The next prime is 12414320167. The reversal of 12414320141 is 14102341421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14102341421 = 7 ⋅2014620203.
It can be written as a sum of positive squares in 2 ways, for example, as 232562500 + 12181757641 = 15250^2 + 110371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12414320141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12414320101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23074676 + ... + 23075213.
It is an arithmetic number, because the mean of its divisors is an integer number (3115117575).
Almost surely, 212414320141 is an apocalyptic number.
It is an amenable number.
12414320141 is a deficient number, since it is larger than the sum of its proper divisors (46150159).
12414320141 is an equidigital number, since it uses as much as digits as its factorization.
12414320141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46150158.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 12414320141 its reverse (14102341421), we get a palindrome (26516661562).
The spelling of 12414320141 in words is "twelve billion, four hundred fourteen million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •