Base | Representation |
---|---|
bin | 11001001010000… |
… | …010010010100110 |
3 | 1002102011221011010 |
4 | 121022002102212 |
5 | 1331021424342 |
6 | 105514123050 |
7 | 13313314122 |
oct | 3112022246 |
9 | 1072157133 |
10 | 422061222 |
11 | 1a7273930 |
12 | b9420486 |
13 | 69596c8b |
14 | 400a8582 |
15 | 270c029c |
hex | 192824a6 |
422061222 has 64 divisors (see below), whose sum is σ = 945561600. Its totient is φ = 124498080.
The previous prime is 422061217. The next prime is 422061223. The reversal of 422061222 is 222160224.
It is a super-2 number, since 2×4220612222 = 356271350232266568, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422061223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1113429 + ... + 1113807.
It is an arithmetic number, because the mean of its divisors is an integer number (14774400).
Almost surely, 2422061222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 422061222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (472780800).
422061222 is an abundant number, since it is smaller than the sum of its proper divisors (523500378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
422061222 is a wasteful number, since it uses less digits than its factorization.
422061222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 422061222 is about 20544.1286502981. The cubic root of 422061222 is about 750.1103375445.
The spelling of 422061222 in words is "four hundred twenty-two million, sixty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •