Base | Representation |
---|---|
bin | 1001101100101000… |
… | …01110101100110011 |
3 | 111102211110101201121 |
4 | 10312110032230303 |
5 | 41130244140201 |
6 | 2220335443111 |
7 | 243005211265 |
oct | 46624165463 |
9 | 14384411647 |
10 | 5206240051 |
11 | 2231872231 |
12 | 1013686497 |
13 | 64c7bc21c |
14 | 375629b35 |
15 | 2070e49a1 |
hex | 13650eb33 |
5206240051 has 8 divisors (see below), whose sum is σ = 5387872320. Its totient is φ = 5024748288.
The previous prime is 5206240019. The next prime is 5206240057. The reversal of 5206240051 is 1500426025.
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 5206240051 - 25 = 5206240019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5206239998 and 5206240025.
It is not an unprimeable number, because it can be changed into a prime (5206240057) 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, 43270 + ... + 110836.
It is an arithmetic number, because the mean of its divisors is an integer number (673484040).
Almost surely, 25206240051 is an apocalyptic number.
5206240051 is a deficient number, since it is larger than the sum of its proper divisors (181632269).
5206240051 is a wasteful number, since it uses less digits than its factorization.
5206240051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70253.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 5206240051 is about 72154.2795057923. The cubic root of 5206240051 is about 1733.1709306136.
Adding to 5206240051 its reverse (1500426025), we get a palindrome (6706666076).
The spelling of 5206240051 in words is "five billion, two hundred six million, two hundred forty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.234 sec. • engine limits •