Base | Representation |
---|---|
bin | 1001100111110000… |
… | …00011011100001111 |
3 | 111022222102101210211 |
4 | 10303320003130033 |
5 | 41034304040341 |
6 | 2212314143251 |
7 | 242000215063 |
oct | 46370033417 |
9 | 14288371724 |
10 | 5165299471 |
11 | 2210749a42 |
12 | 1001a21b27 |
13 | 644186527 |
14 | 37000daa3 |
15 | 203709181 |
hex | 133e0370f |
5165299471 has 8 divisors (see below), whose sum is σ = 5240860560. Its totient is φ = 5089868352.
The previous prime is 5165299439. The next prime is 5165299547. The reversal of 5165299471 is 1749925615.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5165299471 - 25 = 5165299439 is a prime.
It is a super-3 number, since 3×51652994713 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5165299571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49056 + ... + 112858.
It is an arithmetic number, because the mean of its divisors is an integer number (655107570).
Almost surely, 25165299471 is an apocalyptic number.
5165299471 is a deficient number, since it is larger than the sum of its proper divisors (75561089).
5165299471 is a wasteful number, since it uses less digits than its factorization.
5165299471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64985.
The product of its digits is 680400, while the sum is 49.
The square root of 5165299471 is about 71870.0178864594. The cubic root of 5165299471 is about 1728.6158943853.
The spelling of 5165299471 in words is "five billion, one hundred sixty-five million, two hundred ninety-nine thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •