Base | Representation |
---|---|
bin | 100100010111000… |
… | …0111110010001110 |
3 | 10011000201222001100 |
4 | 1020232013302032 |
5 | 4444313100222 |
6 | 321021523530 |
7 | 42143153160 |
oct | 11056076216 |
9 | 3130658040 |
10 | 1220050062 |
11 | 576760740 |
12 | 2a07135a6 |
13 | 1659c461a |
14 | b806c930 |
15 | 7219b4ac |
hex | 48b87c8e |
1220050062 has 144 divisors (see below), whose sum is σ = 3392468352. Its totient is φ = 307851840.
The previous prime is 1220050061. The next prime is 1220050093. The reversal of 1220050062 is 2600500221.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220050061) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1897113 + ... + 1897755.
It is an arithmetic number, because the mean of its divisors is an integer number (23558808).
Almost surely, 21220050062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1220050062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1696234176).
1220050062 is an abundant number, since it is smaller than the sum of its proper divisors (2172418290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220050062 is a wasteful number, since it uses less digits than its factorization.
1220050062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743 (or 703 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 1220050062 is about 34929.2150212397. The cubic root of 1220050062 is about 1068.5443454504.
Adding to 1220050062 its reverse (2600500221), we get a palindrome (3820550283).
The spelling of 1220050062 in words is "one billion, two hundred twenty million, fifty thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •