Base | Representation |
---|---|
bin | 1011000010110100110010… |
… | …0001110110001111100101 |
3 | 1120222212121110021010212210 |
4 | 2300231030201312033211 |
5 | 3042423141030042031 |
6 | 41454253350234033 |
7 | 2362212511043151 |
oct | 260551441661745 |
9 | 46885543233783 |
10 | 12143156487141 |
11 | 396197a2a14a9 |
12 | 1441512655919 |
13 | 6a11301c6944 |
14 | 2dda3650a061 |
15 | 160d10ce7746 |
hex | b0b4c8763e5 |
12143156487141 has 8 divisors (see below), whose sum is σ = 17143279746624. Its totient is φ = 7619235442880.
The previous prime is 12143156487103. The next prime is 12143156487193. The reversal of 12143156487141 is 14178465134121.
12143156487141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12143156487141 - 211 = 12143156485093 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12143156486141) 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, 119050553745 + ... + 119050553846.
It is an arithmetic number, because the mean of its divisors is an integer number (2142909968328).
Almost surely, 212143156487141 is an apocalyptic number.
It is an amenable number.
12143156487141 is a deficient number, since it is larger than the sum of its proper divisors (5000123259483).
12143156487141 is a wasteful number, since it uses less digits than its factorization.
12143156487141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238101107611.
The product of its digits is 645120, while the sum is 48.
The spelling of 12143156487141 in words is "twelve trillion, one hundred forty-three billion, one hundred fifty-six million, four hundred eighty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •