Base | Representation |
---|---|
bin | 1001110111100110… |
… | …00001000100101101 |
3 | 111200020111021122102 |
4 | 10323303001010231 |
5 | 41322314244111 |
6 | 2233422424445 |
7 | 245202633563 |
oct | 47363010455 |
9 | 14606437572 |
10 | 5298196781 |
11 | 227976a729 |
12 | 103a432125 |
13 | 6658779a7 |
14 | 383925a33 |
15 | 21020b13b |
hex | 13bcc112d |
5298196781 has 4 divisors (see below), whose sum is σ = 5398162812. Its totient is φ = 5198230752.
The previous prime is 5298196733. The next prime is 5298196837. The reversal of 5298196781 is 1876918925.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1995855625 + 3302341156 = 44675^2 + 57466^2 .
It is a cyclic number.
It is not a de Polignac number, because 5298196781 - 230 = 4224454957 is a prime.
It is a super-2 number, since 2×52981967812 = 56141778260397523922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5298196381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49982936 + ... + 49983041.
It is an arithmetic number, because the mean of its divisors is an integer number (1349540703).
Almost surely, 25298196781 is an apocalyptic number.
It is an amenable number.
5298196781 is a deficient number, since it is larger than the sum of its proper divisors (99966031).
5298196781 is an equidigital number, since it uses as much as digits as its factorization.
5298196781 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99966030.
The product of its digits is 2177280, while the sum is 56.
The square root of 5298196781 is about 72788.7132802882. The cubic root of 5298196781 is about 1743.3156469813.
The spelling of 5298196781 in words is "five billion, two hundred ninety-eight million, one hundred ninety-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •