Base | Representation |
---|---|
bin | 111001011000010111… |
… | …0011010011010110101 |
3 | 102210001200202212111121 |
4 | 1302300232122122311 |
5 | 4004330323304031 |
6 | 132335222503541 |
7 | 11621415032155 |
oct | 1626056323265 |
9 | 383050685447 |
10 | 123224041141 |
11 | 48293838a33 |
12 | 1ba6b594bb1 |
13 | b80a122816 |
14 | 5d6d5cc765 |
15 | 3313052011 |
hex | 1cb0b9a6b5 |
123224041141 has 4 divisors (see below), whose sum is σ = 123275753152. Its totient is φ = 123172329132.
The previous prime is 123224041133. The next prime is 123224041151. The reversal of 123224041141 is 141140422321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141140422321 = 977 ⋅144463073.
It is a cyclic number.
It is not a de Polignac number, because 123224041141 - 23 = 123224041133 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 (123224041151) 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, 25852431 + ... + 25857196.
It is an arithmetic number, because the mean of its divisors is an integer number (30818938288).
Almost surely, 2123224041141 is an apocalyptic number.
It is an amenable number.
123224041141 is a deficient number, since it is larger than the sum of its proper divisors (51712011).
123224041141 is an equidigital number, since it uses as much as digits as its factorization.
123224041141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51712010.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 123224041141 its reverse (141140422321), we get a palindrome (264364463462).
The spelling of 123224041141 in words is "one hundred twenty-three billion, two hundred twenty-four million, forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •