Base | Representation |
---|---|
bin | 1001101000110101… |
… | …00101000010011101 |
3 | 111100121110012202220 |
4 | 10310122211002131 |
5 | 41044113144411 |
6 | 2213240135553 |
7 | 242140151313 |
oct | 46432450235 |
9 | 14317405686 |
10 | 5174349981 |
11 | 22158707a9 |
12 | 1004a675b9 |
13 | 646004b68 |
14 | 3712c80b3 |
15 | 2043e5b06 |
hex | 1346a509d |
5174349981 has 8 divisors (see below), whose sum is σ = 6913186464. Its totient is φ = 3442540080.
The previous prime is 5174349941. The next prime is 5174350001. The reversal of 5174349981 is 1899434715.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5174349981 - 211 = 5174347933 is a prime.
It is a super-2 number, since 2×51743499812 = 53547795451749400722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5174349931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1754926 + ... + 1757871.
It is an arithmetic number, because the mean of its divisors is an integer number (864148308).
Almost surely, 25174349981 is an apocalyptic number.
It is an amenable number.
5174349981 is a deficient number, since it is larger than the sum of its proper divisors (1738836483).
5174349981 is a wasteful number, since it uses less digits than its factorization.
5174349981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3513291.
The product of its digits is 1088640, while the sum is 51.
The square root of 5174349981 is about 71932.9547634462. The cubic root of 5174349981 is about 1729.6249179602.
The spelling of 5174349981 in words is "five billion, one hundred seventy-four million, three hundred forty-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •