Base | Representation |
---|---|
bin | 111110000111110… |
… | …000110001111001 |
3 | 2200122010101002021 |
4 | 332013300301321 |
5 | 4113302102301 |
6 | 251230234441 |
7 | 34553512456 |
oct | 7607606171 |
9 | 2618111067 |
10 | 1042222201 |
11 | 495341a69 |
12 | 251055a21 |
13 | 137c01337 |
14 | 9c5bc82d |
15 | 617718a1 |
hex | 3e1f0c79 |
1042222201 has 8 divisors (see below), whose sum is σ = 1077382400. Its totient is φ = 1007158320.
The previous prime is 1042222193. The next prime is 1042222217. The reversal of 1042222201 is 1022222401.
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 1042222201 - 23 = 1042222193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1042222231) 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, 1731 + ... + 45688.
It is an arithmetic number, because the mean of its divisors is an integer number (134672800).
Almost surely, 21042222201 is an apocalyptic number.
It is an amenable number.
1042222201 is a deficient number, since it is larger than the sum of its proper divisors (35160199).
1042222201 is an equidigital number, since it uses as much as digits as its factorization.
1042222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48159.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 1042222201 is about 32283.4663721231. The cubic root of 1042222201 is about 1013.8805070779.
Adding to 1042222201 its reverse (1022222401), we get a palindrome (2064444602).
It can be divided in two parts, 10422 and 22201, that added together give a palindrome (32623).
The spelling of 1042222201 in words is "one billion, forty-two million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •