Base | Representation |
---|---|
bin | 101010010111100… |
… | …0011011100111100 |
3 | 10200002000211110120 |
4 | 1110233003130330 |
5 | 10402413333202 |
6 | 353022134540 |
7 | 50141402535 |
oct | 12457033474 |
9 | 3602024416 |
10 | 1421621052 |
11 | 66a516a35 |
12 | 338121450 |
13 | 1986ab9b7 |
14 | d6b3d68c |
15 | 84c160bc |
hex | 54bc373c |
1421621052 has 24 divisors (see below), whose sum is σ = 3341332176. Its totient is φ = 470414208.
The previous prime is 1421621051. The next prime is 1421621077. The reversal of 1421621052 is 2501261241.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421621051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 430723 + ... + 434010.
It is an arithmetic number, because the mean of its divisors is an integer number (139222174).
Almost surely, 21421621052 is an apocalyptic number.
1421621052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1421621052 is an abundant number, since it is smaller than the sum of its proper divisors (1919711124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1421621052 is a wasteful number, since it uses less digits than its factorization.
1421621052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 864877 (or 864875 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 1421621052 is about 37704.3903544402. The cubic root of 1421621052 is about 1124.4184126746.
Adding to 1421621052 its reverse (2501261241), we get a palindrome (3922882293).
The spelling of 1421621052 in words is "one billion, four hundred twenty-one million, six hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •