Base | Representation |
---|---|
bin | 100100100010110… |
… | …1010010011000110 |
3 | 10011110100110122001 |
4 | 1021011222103012 |
5 | 10002403030432 |
6 | 321402055514 |
7 | 42246463405 |
oct | 11105522306 |
9 | 3143313561 |
10 | 1226220742 |
11 | 57a19587a |
12 | 2a27aa59a |
13 | 167075206 |
14 | b8bd763c |
15 | 729b99e7 |
hex | 4916a4c6 |
1226220742 has 4 divisors (see below), whose sum is σ = 1839331116. Its totient is φ = 613110370.
The previous prime is 1226220733. The next prime is 1226220797. The reversal of 1226220742 is 2470226221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2470226221 = 439 ⋅5626939.
It is a super-2 number, since 2×12262207422 = 3007234616222061128, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1226220742.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306555184 + ... + 306555187.
It is an arithmetic number, because the mean of its divisors is an integer number (459832779).
Almost surely, 21226220742 is an apocalyptic number.
1226220742 is a deficient number, since it is larger than the sum of its proper divisors (613110374).
1226220742 is an equidigital number, since it uses as much as digits as its factorization.
1226220742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613110373.
The product of its (nonzero) digits is 5376, while the sum is 28.
The square root of 1226220742 is about 35017.4348289534. The cubic root of 1226220742 is about 1070.3427853318.
Adding to 1226220742 its reverse (2470226221), we get a palindrome (3696446963).
The spelling of 1226220742 in words is "one billion, two hundred twenty-six million, two hundred twenty thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •