Base | Representation |
---|---|
bin | 1010111101000011100011… |
… | …0110001000100111010111 |
3 | 1120122101202222220011221102 |
4 | 2233100320312020213113 |
5 | 3034312144223410033 |
6 | 41340542335140315 |
7 | 2352103405651130 |
oct | 257207066104727 |
9 | 46571688804842 |
10 | 12044042013143 |
11 | 3923938802178 |
12 | 142627137469b |
13 | 694995cb37aa |
14 | 2d8d12d18c87 |
15 | 15d45e6cade8 |
hex | af438d889d7 |
12044042013143 has 8 divisors (see below), whose sum is σ = 13766304078720. Its totient is φ = 10322201106360.
The previous prime is 12044042013127. The next prime is 12044042013191. The reversal of 12044042013143 is 34131024044021.
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 12044042013143 - 24 = 12044042013127 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 (12044042013103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105228413 + ... + 105342806.
It is an arithmetic number, because the mean of its divisors is an integer number (1720788009840).
Almost surely, 212044042013143 is an apocalyptic number.
12044042013143 is a deficient number, since it is larger than the sum of its proper divisors (1722262065577).
12044042013143 is an equidigital number, since it uses as much as digits as its factorization.
12044042013143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210579397.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 12044042013143 its reverse (34131024044021), we get a palindrome (46175066057164).
The spelling of 12044042013143 in words is "twelve trillion, forty-four billion, forty-two million, thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •