Base | Representation |
---|---|
bin | 1110111011110101110… |
… | …10011000001101000001 |
3 | 1211001120020011012000001 |
4 | 13131322322120031001 |
5 | 31401424241411230 |
6 | 1031424405000001 |
7 | 52034443334251 |
oct | 7357272301501 |
9 | 1731506135001 |
10 | 513163232065 |
11 | 1886a42a2590 |
12 | 835553b3001 |
13 | 395112a23a3 |
14 | 1aba151d961 |
15 | d53657a0ca |
hex | 777ae98341 |
513163232065 has 32 divisors (see below), whose sum is σ = 677100767616. Its totient is φ = 370263759360.
The previous prime is 513163232053. The next prime is 513163232077. The reversal of 513163232065 is 560232361315.
It is an interprime number because it is at equal distance from previous prime (513163232053) and next prime (513163232077).
It is not a de Polignac number, because 513163232065 - 237 = 375724278593 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3477474 + ... + 3622036.
It is an arithmetic number, because the mean of its divisors is an integer number (21159398988).
Almost surely, 2513163232065 is an apocalyptic number.
513163232065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
513163232065 is a deficient number, since it is larger than the sum of its proper divisors (163937535551).
513163232065 is a wasteful number, since it uses less digits than its factorization.
513163232065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145089.
The product of its (nonzero) digits is 97200, while the sum is 37.
The spelling of 513163232065 in words is "five hundred thirteen billion, one hundred sixty-three million, two hundred thirty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •