Base | Representation |
---|---|
bin | 1111101110011001… |
… | …0011001110001110 |
3 | 101220011210012000110 |
4 | 3323212103032032 |
5 | 32121101341142 |
6 | 1534505140450 |
7 | 206413640310 |
oct | 37346231616 |
9 | 11804705013 |
10 | 4221121422 |
11 | 1876793001 |
12 | 99978a726 |
13 | 5236926ab |
14 | 2c08737b0 |
15 | 19a8a299c |
hex | fb99338e |
4221121422 has 16 divisors (see below), whose sum is σ = 9648277632. Its totient is φ = 1206034680.
The previous prime is 4221121351. The next prime is 4221121423. The reversal of 4221121422 is 2241211224.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4221121423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50251404 + ... + 50251487.
It is an arithmetic number, because the mean of its divisors is an integer number (603017352).
Almost surely, 24221121422 is an apocalyptic number.
4221121422 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
4221121422 is an abundant number, since it is smaller than the sum of its proper divisors (5427156210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4221121422 is a wasteful number, since it uses less digits than its factorization.
4221121422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100502903.
The product of its digits is 512, while the sum is 21.
The square root of 4221121422 is about 64970.1579342393. The cubic root of 4221121422 is about 1616.1287207432.
Adding to 4221121422 its reverse (2241211224), we get a palindrome (6462332646).
The spelling of 4221121422 in words is "four billion, two hundred twenty-one million, one hundred twenty-one thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •