Base | Representation |
---|---|
bin | 111101101001010… |
… | …000101000101101 |
3 | 2200002002010122212 |
4 | 331221100220231 |
5 | 4104230214341 |
6 | 250343020205 |
7 | 34425530540 |
oct | 7551205055 |
9 | 2602063585 |
10 | 1034226221 |
11 | 490880516 |
12 | 24a43a665 |
13 | 1363619a2 |
14 | 9b4da857 |
15 | 60be25eb |
hex | 3da50a2d |
1034226221 has 16 divisors (see below), whose sum is σ = 1245135360. Its totient is φ = 839179440.
The previous prime is 1034226203. The next prime is 1034226223. The reversal of 1034226221 is 1226224301.
It is a happy number.
1034226221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1034226221 - 218 = 1033964077 is a prime.
It is a super-3 number, since 3×10342262213 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034226223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254810 + ... + 258836.
It is an arithmetic number, because the mean of its divisors is an integer number (77820960).
Almost surely, 21034226221 is an apocalyptic number.
It is an amenable number.
1034226221 is a deficient number, since it is larger than the sum of its proper divisors (210909139).
1034226221 is a wasteful number, since it uses less digits than its factorization.
1034226221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5984.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 1034226221 is about 32159.3877584758. The cubic root of 1034226221 is about 1011.2810008103.
It can be divided in two parts, 10342 and 26221, that added together give a palindrome (36563).
The spelling of 1034226221 in words is "one billion, thirty-four million, two hundred twenty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •