Base | Representation |
---|---|
bin | 1001100101010110… |
… | …00101010111101001 |
3 | 111021120110021220111 |
4 | 10302223011113221 |
5 | 41014122403111 |
6 | 2210313454321 |
7 | 241333550335 |
oct | 46253052751 |
9 | 14246407814 |
10 | 5145122281 |
11 | 2200318582 |
12 | bb71113a1 |
13 | 63cc40570 |
14 | 36b47a7c5 |
15 | 201a70a21 |
hex | 132ac55e9 |
5145122281 has 8 divisors (see below), whose sum is σ = 5618942784. Its totient is φ = 4682450640.
The previous prime is 5145122263. The next prime is 5145122291. The reversal of 5145122281 is 1822215415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5145122281 - 27 = 5145122153 is a prime.
It is a super-2 number, since 2×51451222812 = 52944566572885285922, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5145122251) 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, 2786251 + ... + 2788096.
It is an arithmetic number, because the mean of its divisors is an integer number (702367848).
Almost surely, 25145122281 is an apocalyptic number.
It is an amenable number.
5145122281 is a deficient number, since it is larger than the sum of its proper divisors (473820503).
5145122281 is a wasteful number, since it uses less digits than its factorization.
5145122281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5574431.
The product of its digits is 6400, while the sum is 31.
The square root of 5145122281 is about 71729.5077426299. The cubic root of 5145122281 is about 1726.3621286068.
Adding to 5145122281 its reverse (1822215415), we get a palindrome (6967337696).
The spelling of 5145122281 in words is "five billion, one hundred forty-five million, one hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.526 sec. • engine limits •