Base | Representation |
---|---|
bin | 111110000111110… |
… | …101101010101110 |
3 | 2200122011101112210 |
4 | 332013311222232 |
5 | 4113303222342 |
6 | 251230511250 |
7 | 34553625030 |
oct | 7607655256 |
9 | 2618141483 |
10 | 1042242222 |
11 | 49535600a |
12 | 251065526 |
13 | 137c0a498 |
14 | 9c5c5c50 |
15 | 6177779c |
hex | 3e1f5aae |
1042242222 has 64 divisors (see below), whose sum is σ = 2583995904. Its totient is φ = 273423360.
The previous prime is 1042242211. The next prime is 1042242241. The reversal of 1042242222 is 2222422401.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11473 + ... + 47075.
It is an arithmetic number, because the mean of its divisors is an integer number (40374936).
Almost surely, 21042242222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1042242222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1291997952).
1042242222 is an abundant number, since it is smaller than the sum of its proper divisors (1541753682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042242222 is a wasteful number, since it uses less digits than its factorization.
1042242222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35673.
The product of its (nonzero) digits is 1024, while the sum is 21.
The square root of 1042242222 is about 32283.7764519580. The cubic root of 1042242222 is about 1013.8869992225.
Adding to 1042242222 its reverse (2222422401), we get a palindrome (3264664623).
The spelling of 1042242222 in words is "one billion, forty-two million, two hundred forty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •