Base | Representation |
---|---|
bin | 11110101101111… |
… | …001101000000001 |
3 | 1022220201102220202 |
4 | 132231321220001 |
5 | 2023412131433 |
6 | 123045414545 |
7 | 15525252125 |
oct | 3655715001 |
9 | 1286642822 |
10 | 515348993 |
11 | 2449a0365 |
12 | 12470a455 |
13 | 829ca543 |
14 | 4c62d585 |
15 | 3039aee8 |
hex | 1eb79a01 |
515348993 has 4 divisors (see below), whose sum is σ = 517354500. Its totient is φ = 513343488.
The previous prime is 515348983. The next prime is 515349013. The reversal of 515348993 is 399843515.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 399843515 = 5 ⋅79968703.
It can be written as a sum of positive squares in 2 ways, for example, as 499611904 + 15737089 = 22352^2 + 3967^2 .
It is a cyclic number.
It is not a de Polignac number, because 515348993 - 210 = 515347969 is a prime.
It is a super-2 number, since 2×5153489932 = 531169169172228098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (515348983) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1002368 + ... + 1002881.
It is an arithmetic number, because the mean of its divisors is an integer number (129338625).
Almost surely, 2515348993 is an apocalyptic number.
It is an amenable number.
515348993 is a deficient number, since it is larger than the sum of its proper divisors (2005507).
515348993 is a wasteful number, since it uses less digits than its factorization.
515348993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005506.
The product of its digits is 583200, while the sum is 47.
The square root of 515348993 is about 22701.2993680979. The cubic root of 515348993 is about 801.7404778625.
The spelling of 515348993 in words is "five hundred fifteen million, three hundred forty-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •