Base | Representation |
---|---|
bin | 1001101011100100… |
… | …11000111001110111 |
3 | 111102012202200212100 |
4 | 10311302120321313 |
5 | 41121011301301 |
6 | 2215421353143 |
7 | 242536623105 |
oct | 46562307167 |
9 | 14365680770 |
10 | 5197368951 |
11 | 2227863245 |
12 | 10107087b3 |
13 | 64aa04458 |
14 | 37439ac75 |
15 | 206441286 |
hex | 135c98e77 |
5197368951 has 24 divisors (see below), whose sum is σ = 7789775760. Its totient is φ = 3335270400.
The previous prime is 5197368907. The next prime is 5197368961. The reversal of 5197368951 is 1598637915.
5197368951 is a `hidden beast` number, since 5 + 197 + 368 + 95 + 1 = 666.
5197368951 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5197368951 - 211 = 5197366903 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5197368961) 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 23 ways as a sum of consecutive naturals, for example, 56311 + ... + 116471.
It is an arithmetic number, because the mean of its divisors is an integer number (324573990).
Almost surely, 25197368951 is an apocalyptic number.
5197368951 is a deficient number, since it is larger than the sum of its proper divisors (2592406809).
5197368951 is a wasteful number, since it uses less digits than its factorization.
5197368951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60527 (or 60524 counting only the distinct ones).
The product of its digits is 2041200, while the sum is 54.
The square root of 5197368951 is about 72092.7801586261. The cubic root of 5197368951 is about 1732.1859668319.
The spelling of 5197368951 in words is "five billion, one hundred ninety-seven million, three hundred sixty-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •