Base | Representation |
---|---|
bin | 111110001000001… |
… | …101110101100111 |
3 | 2200122100102100111 |
4 | 332020031311213 |
5 | 4113314404343 |
6 | 251232553451 |
7 | 34554516460 |
oct | 7610156547 |
9 | 2618312314 |
10 | 1042341223 |
11 | 495413430 |
12 | 2510b2887 |
13 | 137c43571 |
14 | 9c60dd67 |
15 | 61796c9d |
hex | 3e20dd67 |
1042341223 has 8 divisors (see below), whose sum is σ = 1299542400. Its totient is φ = 812213880.
The previous prime is 1042341217. The next prime is 1042341227. The reversal of 1042341223 is 3221432401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1042341223 - 25 = 1042341191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1042341194 and 1042341203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042341227) 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 7 ways as a sum of consecutive naturals, for example, 6768373 + ... + 6768526.
It is an arithmetic number, because the mean of its divisors is an integer number (162442800).
Almost surely, 21042341223 is an apocalyptic number.
1042341223 is a deficient number, since it is larger than the sum of its proper divisors (257201177).
1042341223 is a wasteful number, since it uses less digits than its factorization.
1042341223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13536917.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1042341223 is about 32285.3097089063. The cubic root of 1042341223 is about 1013.9191007329.
Adding to 1042341223 its reverse (3221432401), we get a palindrome (4263773624).
The spelling of 1042341223 in words is "one billion, forty-two million, three hundred forty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •