Base | Representation |
---|---|
bin | 10011101101110100001101 |
3 | 100201120201010 |
4 | 103231310031 |
5 | 2310342042 |
6 | 302435433 |
7 | 61634133 |
oct | 23556415 |
9 | 10646633 |
10 | 5168397 |
11 | 2a10103 |
12 | 1892b79 |
13 | 10bc630 |
14 | 987753 |
15 | 6c159c |
hex | 4edd0d |
5168397 has 8 divisors (see below), whose sum is σ = 7421344. Its totient is φ = 3180528.
The previous prime is 5168393. The next prime is 5168407. The reversal of 5168397 is 7938615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5168397 - 22 = 5168393 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 132523 = 5168397 / (5 + 1 + 6 + 8 + 3 + 9 + 7).
It is a Duffinian number.
It is a nialpdrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5168393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66223 + ... + 66300.
It is an arithmetic number, because the mean of its divisors is an integer number (927668).
Almost surely, 25168397 is an apocalyptic number.
It is an amenable number.
5168397 is a deficient number, since it is larger than the sum of its proper divisors (2252947).
5168397 is a wasteful number, since it uses less digits than its factorization.
5168397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132539.
The product of its digits is 45360, while the sum is 39.
The square root of 5168397 is about 2273.4108735554. The cubic root of 5168397 is about 172.8961364377.
It can be divided in two parts, 5168 and 397, that added together give a triangular number (5565 = T105).
The spelling of 5168397 in words is "five million, one hundred sixty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •