Base | Representation |
---|---|
bin | 1111000000010000000… |
… | …11100010010010101101 |
3 | 1211021200020221102222010 |
4 | 13200020003202102231 |
5 | 31421301443021031 |
6 | 1032455355111433 |
7 | 52150226032500 |
oct | 7401003422255 |
9 | 1737606842863 |
10 | 515531220141 |
11 | 1896a9a30023 |
12 | 83ab6442579 |
13 | 397caa60372 |
14 | 1ad47c09137 |
15 | d6243cb246 |
hex | 78080e24ad |
515531220141 has 24 divisors (see below), whose sum is σ = 811533779040. Its totient is φ = 290192408352.
The previous prime is 515531220133. The next prime is 515531220163. The reversal of 515531220141 is 141022135515.
It is not a de Polignac number, because 515531220141 - 23 = 515531220133 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 515531220099 and 515531220108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (515531220121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26161906 + ... + 26181603.
It is an arithmetic number, because the mean of its divisors is an integer number (33813907460).
Almost surely, 2515531220141 is an apocalyptic number.
It is an amenable number.
515531220141 is a deficient number, since it is larger than the sum of its proper divisors (296002558899).
515531220141 is a wasteful number, since it uses less digits than its factorization.
515531220141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52343593 (or 52343586 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 515531220141 its reverse (141022135515), we get a palindrome (656553355656).
The spelling of 515531220141 in words is "five hundred fifteen billion, five hundred thirty-one million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •