Base | Representation |
---|---|
bin | 1001101101001100… |
… | …11011011010100001 |
3 | 111110011102202212002 |
4 | 10312212123122201 |
5 | 41133004320341 |
6 | 2221030013345 |
7 | 243063601040 |
oct | 46646333241 |
9 | 14404382762 |
10 | 5211010721 |
11 | 2234530534 |
12 | 10151a7255 |
13 | 65079c7c7 |
14 | 37610c557 |
15 | 20773829b |
hex | 13699b6a1 |
5211010721 has 8 divisors (see below), whose sum is σ = 6067808064. Its totient is φ = 4382305200.
The previous prime is 5211010687. The next prime is 5211010723. The reversal of 5211010721 is 1270101125.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5211010721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5211010693 and 5211010702.
It is not an unprimeable number, because it can be changed into a prime (5211010723) 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, 7022555 + ... + 7023296.
It is an arithmetic number, because the mean of its divisors is an integer number (758476008).
Almost surely, 25211010721 is an apocalyptic number.
It is an amenable number.
5211010721 is a deficient number, since it is larger than the sum of its proper divisors (856797343).
5211010721 is a wasteful number, since it uses less digits than its factorization.
5211010721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14045911.
The product of its (nonzero) digits is 140, while the sum is 20.
The square root of 5211010721 is about 72187.3307513167. The cubic root of 5211010721 is about 1733.7001585032.
Adding to 5211010721 its reverse (1270101125), we get a palindrome (6481111846).
The spelling of 5211010721 in words is "five billion, two hundred eleven million, ten thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •