Base | Representation |
---|---|
bin | 111010100011011010011100… |
… | …1001110011010110001110001 |
3 | 2111112121101200201010220021001 |
4 | 1311012310321032122301301 |
5 | 1020001411023122043231 |
6 | 5023222210325402001 |
7 | 213325311020635606 |
oct | 16506647116326161 |
9 | 2445541621126231 |
10 | 515040553315441 |
11 | 13a1205212a347a |
12 | 49922387269301 |
13 | 191501674972ba |
14 | 912814abb26ad |
15 | 3e825c03e4b61 |
hex | 1d46d3939ac71 |
515040553315441 has 32 divisors (see below), whose sum is σ = 532904151744000. Its totient is φ = 497575898127360.
The previous prime is 515040553315439. The next prime is 515040553315469. The reversal of 515040553315441 is 144513355040515.
It is a cyclic number.
It is not a de Polignac number, because 515040553315441 - 21 = 515040553315439 is a prime.
It is a super-3 number, since 3×5150405533154413 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 515040553315391 and 515040553315400.
It is not an unprimeable number, because it can be changed into a prime (515040553315481) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1241006635 + ... + 1241421583.
It is an arithmetic number, because the mean of its divisors is an integer number (16653254742000).
Almost surely, 2515040553315441 is an apocalyptic number.
It is an amenable number.
515040553315441 is a deficient number, since it is larger than the sum of its proper divisors (17863598428559).
515040553315441 is a wasteful number, since it uses less digits than its factorization.
515040553315441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416809.
The product of its (nonzero) digits is 1800000, while the sum is 46.
The spelling of 515040553315441 in words is "five hundred fifteen trillion, forty billion, five hundred fifty-three million, three hundred fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •