Base | Representation |
---|---|
bin | 10001110011000010111… |
… | …111100001000010000101 |
3 | 11022220212220120012222202 |
4 | 101303002333201002011 |
5 | 130014242242023331 |
6 | 2333505141404245 |
7 | 154235060452415 |
oct | 21630277410205 |
9 | 4286786505882 |
10 | 1223042142341 |
11 | 43176444a738 |
12 | 17904a409685 |
13 | 8b442310866 |
14 | 432a4866645 |
15 | 21c32a71ecb |
hex | 11cc2fe1085 |
1223042142341 has 4 divisors (see below), whose sum is σ = 1223044752684. Its totient is φ = 1223039532000.
The previous prime is 1223042142319. The next prime is 1223042142353. The reversal of 1223042142341 is 1432412403221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 644735126116 + 578307016225 = 802954^2 + 760465^2 .
It is a cyclic number.
It is not a de Polignac number, because 1223042142341 - 234 = 1205862273157 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 (1223042142541) 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, 387110 + ... + 1611191.
It is an arithmetic number, because the mean of its divisors is an integer number (305761188171).
Almost surely, 21223042142341 is an apocalyptic number.
It is an amenable number.
1223042142341 is a deficient number, since it is larger than the sum of its proper divisors (2610343).
1223042142341 is an equidigital number, since it uses as much as digits as its factorization.
1223042142341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2610342.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1223042142341 its reverse (1432412403221), we get a palindrome (2655454545562).
The spelling of 1223042142341 in words is "one trillion, two hundred twenty-three billion, forty-two million, one hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •