Base | Representation |
---|---|
bin | 1001110011010010… |
… | …10100101011100101 |
3 | 111120201120102211211 |
4 | 10321221110223211 |
5 | 41234044214341 |
6 | 2230053031421 |
7 | 244254056656 |
oct | 47151245345 |
9 | 14521512754 |
10 | 5262101221 |
11 | 2260356593 |
12 | 102a325571 |
13 | 65b24a380 |
14 | 37cc0b52d |
15 | 20be7b181 |
hex | 139a54ae5 |
5262101221 has 16 divisors (see below), whose sum is σ = 5802655936. Its totient is φ = 4741099776.
The previous prime is 5262101219. The next prime is 5262101227. The reversal of 5262101221 is 1221012625.
It is a cyclic number.
It is not a de Polignac number, because 5262101221 - 21 = 5262101219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5262101192 and 5262101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5262101227) 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 15 ways as a sum of consecutive naturals, for example, 1229341 + ... + 1233613.
It is an arithmetic number, because the mean of its divisors is an integer number (362665996).
Almost surely, 25262101221 is an apocalyptic number.
It is an amenable number.
5262101221 is a deficient number, since it is larger than the sum of its proper divisors (540554715).
5262101221 is a wasteful number, since it uses less digits than its factorization.
5262101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6532.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 5262101221 is about 72540.3420242833. The cubic root of 5262101221 is about 1739.3476681172.
Adding to 5262101221 its reverse (1221012625), we get a palindrome (6483113846).
The spelling of 5262101221 in words is "five billion, two hundred sixty-two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •