Base | Representation |
---|---|
bin | 1011000010101110001111… |
… | …1010110000101000100111 |
3 | 1120222201002010202222202221 |
4 | 2300223203322300220213 |
5 | 3042411042230110322 |
6 | 41453403253013211 |
7 | 2362121150116345 |
oct | 260534372605047 |
9 | 46881063688687 |
10 | 12141401410087 |
11 | 39611596300a4 |
12 | 1441102924207 |
13 | 6a0c10705101 |
14 | 2dd90b3a8995 |
15 | 160c5bbb49c7 |
hex | b0ae3eb0a27 |
12141401410087 has 2 divisors, whose sum is σ = 12141401410088. Its totient is φ = 12141401410086.
The previous prime is 12141401410009. The next prime is 12141401410121. The reversal of 12141401410087 is 78001410414121.
12141401410087 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (12141401410121) can be obtained adding 12141401410087 to its sum of digits (34).
It is a strong prime.
It is an emirp because it is prime and its reverse (78001410414121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12141401410087 - 239 = 11591645596199 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12141401417087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6070700705043 + 6070700705044.
It is an arithmetic number, because the mean of its divisors is an integer number (6070700705044).
Almost surely, 212141401410087 is an apocalyptic number.
12141401410087 is a deficient number, since it is larger than the sum of its proper divisors (1).
12141401410087 is an equidigital number, since it uses as much as digits as its factorization.
12141401410087 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7168, while the sum is 34.
The spelling of 12141401410087 in words is "twelve trillion, one hundred forty-one billion, four hundred one million, four hundred ten thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •