Base | Representation |
---|---|
bin | 10011001010011011111010… |
… | …01010110010011110000111 |
3 | 12112012112202201212020010101 |
4 | 21211031331022302132013 |
5 | 21010410232133334343 |
6 | 225342505420104531 |
7 | 11606342036663260 |
oct | 1145157512623607 |
9 | 175175681766111 |
10 | 42140024121223 |
11 | 12477536034696 |
12 | 4887028995147 |
13 | 1a68a306b8022 |
14 | a59833875967 |
15 | 4d125aad2e4d |
hex | 26537d2b2787 |
42140024121223 has 4 divisors (see below), whose sum is σ = 48160027567120. Its totient is φ = 36120020675328.
The previous prime is 42140024121197. The next prime is 42140024121259. The reversal of 42140024121223 is 32212142004124.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42140024121223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42140024121191 and 42140024121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42140024122223) 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, 3010001722938 + ... + 3010001722951.
It is an arithmetic number, because the mean of its divisors is an integer number (12040006891780).
Almost surely, 242140024121223 is an apocalyptic number.
42140024121223 is a deficient number, since it is larger than the sum of its proper divisors (6020003445897).
42140024121223 is an equidigital number, since it uses as much as digits as its factorization.
42140024121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6020003445896.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 42140024121223 its reverse (32212142004124), we get a palindrome (74352166125347).
The spelling of 42140024121223 in words is "forty-two trillion, one hundred forty billion, twenty-four million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •