Base | Representation |
---|---|
bin | 1010111100111100110110… |
… | …0111110101010100110011 |
3 | 1120122020010121221000202220 |
4 | 2233033031213311110303 |
5 | 3034300003213231003 |
6 | 41340044034212123 |
7 | 2352011003320212 |
oct | 257171547652463 |
9 | 46566117830686 |
10 | 12042243102003 |
11 | 39230a5321654 |
12 | 1425a4aa24043 |
13 | 69476a3b522a |
14 | 2d8bc2047079 |
15 | 15d3a67da353 |
hex | af3cd9f5533 |
12042243102003 has 4 divisors (see below), whose sum is σ = 16056324136008. Its totient is φ = 8028162068000.
The previous prime is 12042243101927. The next prime is 12042243102007. The reversal of 12042243102003 is 30020134224021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12042243102003 - 220 = 12042242053427 is a prime.
It is a super-4 number, since 4×120422431020034 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (12042243102007) 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, 2007040516998 + ... + 2007040517003.
It is an arithmetic number, because the mean of its divisors is an integer number (4014081034002).
Almost surely, 212042243102003 is an apocalyptic number.
12042243102003 is a deficient number, since it is larger than the sum of its proper divisors (4014081034005).
12042243102003 is an equidigital number, since it uses as much as digits as its factorization.
12042243102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4014081034004.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 12042243102003 its reverse (30020134224021), we get a palindrome (42062377326024).
The spelling of 12042243102003 in words is "twelve trillion, forty-two billion, two hundred forty-three million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •