Base | Representation |
---|---|
bin | 1011010100101100101111… |
… | …0010110111101110111111 |
3 | 1122002020020020102001102110 |
4 | 2311023023302313232333 |
5 | 3112441034442143033 |
6 | 42251320402225103 |
7 | 2423333261503134 |
oct | 265131362675677 |
9 | 48066206361373 |
10 | 12450234334143 |
11 | 3a70129782a31 |
12 | 1490b32355193 |
13 | 6c408a4b68a8 |
14 | 31084767058b |
15 | 168cd4a4b363 |
hex | b52cbcb7bbf |
12450234334143 has 8 divisors (see below), whose sum is σ = 16600339757056. Its totient is φ = 8300142567000.
The previous prime is 12450234334127. The next prime is 12450234334157. The reversal of 12450234334143 is 34143343205421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12450234334143 - 24 = 12450234334127 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 (12450234334123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1053433 + ... + 5100018.
It is an arithmetic number, because the mean of its divisors is an integer number (2075042469632).
Almost surely, 212450234334143 is an apocalyptic number.
12450234334143 is a deficient number, since it is larger than the sum of its proper divisors (4150105422913).
12450234334143 is an equidigital number, since it uses as much as digits as its factorization.
12450234334143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6827885.
The product of its (nonzero) digits is 414720, while the sum is 39.
Adding to 12450234334143 its reverse (34143343205421), we get a palindrome (46593577539564).
The spelling of 12450234334143 in words is "twelve trillion, four hundred fifty billion, two hundred thirty-four million, three hundred thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •