Base | Representation |
---|---|
bin | 111110000111110… |
… | …001000001110111 |
3 | 2200122010102111010 |
4 | 332013301001313 |
5 | 4113302120343 |
6 | 251230243303 |
7 | 34553515446 |
oct | 7607610167 |
9 | 2618112433 |
10 | 1042223223 |
11 | 495342808 |
12 | 251056533 |
13 | 137c01942 |
14 | 9c5bcd5d |
15 | 61771d33 |
hex | 3e1f1077 |
1042223223 has 4 divisors (see below), whose sum is σ = 1389630968. Its totient is φ = 694815480.
The previous prime is 1042223201. The next prime is 1042223243. The reversal of 1042223223 is 3223222401.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1042223223 - 25 = 1042223191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1042223223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042223243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 173703868 + ... + 173703873.
It is an arithmetic number, because the mean of its divisors is an integer number (347407742).
Almost surely, 21042223223 is an apocalyptic number.
1042223223 is a deficient number, since it is larger than the sum of its proper divisors (347407745).
1042223223 is an equidigital number, since it uses as much as digits as its factorization.
1042223223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347407744.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 1042223223 is about 32283.4822006549. The cubic root of 1042223223 is about 1013.8808384805.
Adding to 1042223223 its reverse (3223222401), we get a palindrome (4265445624).
The spelling of 1042223223 in words is "one billion, forty-two million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •