Base | Representation |
---|---|
bin | 1001010110101101… |
… | …10011111010100101 |
3 | 110222000110200212022 |
4 | 10223112303322211 |
5 | 40241211224042 |
6 | 2150210432525 |
7 | 235313263355 |
oct | 45326637245 |
9 | 13860420768 |
10 | 5022367397 |
11 | 2147aa4a63 |
12 | b81b92745 |
13 | 620690738 |
14 | 359044b65 |
15 | 1e5dc3cd2 |
hex | 12b5b3ea5 |
5022367397 has 8 divisors (see below), whose sum is σ = 5143653144. Its totient is φ = 4902064128.
The previous prime is 5022367393. The next prime is 5022367411. The reversal of 5022367397 is 7937632205.
It can be written as a sum of positive squares in 4 ways, for example, as 1895209156 + 3127158241 = 43534^2 + 55921^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5022367397 - 22 = 5022367393 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5022367393) 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 7 ways as a sum of consecutive naturals, for example, 235268 + ... + 255725.
It is an arithmetic number, because the mean of its divisors is an integer number (642956643).
Almost surely, 25022367397 is an apocalyptic number.
It is an amenable number.
5022367397 is a deficient number, since it is larger than the sum of its proper divisors (121285747).
5022367397 is a wasteful number, since it uses less digits than its factorization.
5022367397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491239.
The product of its (nonzero) digits is 476280, while the sum is 44.
The square root of 5022367397 is about 70868.6630112351. The cubic root of 5022367397 is about 1712.5220012589.
The spelling of 5022367397 in words is "five billion, twenty-two million, three hundred sixty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •