Base | Representation |
---|---|
bin | 1001111011100001… |
… | …11111101100000011 |
3 | 111202112122002200221 |
4 | 10331300333230003 |
5 | 41404243040001 |
6 | 2241002323511 |
7 | 246053430046 |
oct | 47560775403 |
9 | 14675562627 |
10 | 5331221251 |
11 | 2296376484 |
12 | 10494b9597 |
13 | 66c66b4b5 |
14 | 388080c5d |
15 | 2130811a1 |
hex | 13dc3fb03 |
5331221251 has 4 divisors (see below), whose sum is σ = 5366527504. Its totient is φ = 5295915000.
The previous prime is 5331221243. The next prime is 5331221279. The reversal of 5331221251 is 1521221335.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5331221251 - 23 = 5331221243 is a prime.
It is a super-2 number, since 2×53312212512 = 56843840054228010002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5331221281) 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 3 ways as a sum of consecutive naturals, for example, 17652900 + ... + 17653201.
It is an arithmetic number, because the mean of its divisors is an integer number (1341631876).
Almost surely, 25331221251 is an apocalyptic number.
5331221251 is a deficient number, since it is larger than the sum of its proper divisors (35306253).
5331221251 is a wasteful number, since it uses less digits than its factorization.
5331221251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35306252.
The product of its digits is 1800, while the sum is 25.
The square root of 5331221251 is about 73015.2124628834. The cubic root of 5331221251 is about 1746.9302647877.
Adding to 5331221251 its reverse (1521221335), we get a palindrome (6852442586).
The spelling of 5331221251 in words is "five billion, three hundred thirty-one million, two hundred twenty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •