Base | Representation |
---|---|
bin | 1110111011111010001… |
… | …11001101011011000111 |
3 | 1211001122210121211011221 |
4 | 13131331013031123013 |
5 | 31402013214301330 |
6 | 1031432204141211 |
7 | 52035402205324 |
oct | 7357507153307 |
9 | 1731583554157 |
10 | 513200150215 |
11 | 188713118755 |
12 | 83565837807 |
13 | 39518b2a24c |
14 | 1aba63adb4b |
15 | d53991db7a |
hex | 777d1cd6c7 |
513200150215 has 4 divisors (see below), whose sum is σ = 615840180264. Its totient is φ = 410560120168.
The previous prime is 513200150209. The next prime is 513200150233. The reversal of 513200150215 is 512051002315.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 513200150215 - 231 = 511052666567 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 513200150215.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51320015017 + ... + 51320015026.
It is an arithmetic number, because the mean of its divisors is an integer number (153960045066).
Almost surely, 2513200150215 is an apocalyptic number.
513200150215 is a deficient number, since it is larger than the sum of its proper divisors (102640030049).
513200150215 is a wasteful number, since it uses less digits than its factorization.
513200150215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102640030048.
The product of its (nonzero) digits is 1500, while the sum is 25.
The spelling of 513200150215 in words is "five hundred thirteen billion, two hundred million, one hundred fifty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •