Base | Representation |
---|---|
bin | 1110111000001101011… |
… | …00110100100010010000 |
3 | 1210212112100102121021121 |
4 | 13130012230310202100 |
5 | 31333431130133130 |
6 | 1030503115532024 |
7 | 51635230142455 |
oct | 7340654644220 |
9 | 1725470377247 |
10 | 511213521040 |
11 | 187893783862 |
12 | 830b045a014 |
13 | 39290384b21 |
14 | 1aa585d582c |
15 | d4702ecd7a |
hex | 7706b34890 |
511213521040 has 40 divisors (see below), whose sum is σ = 1188623351808. Its totient is φ = 204476476800.
The previous prime is 511213521031. The next prime is 511213521041. The reversal of 511213521040 is 40125312115.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×5112135210402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 511213520996 and 511213521014.
It is not an unprimeable number, because it can be changed into a prime (511213521041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1886065 + ... + 2140015.
Almost surely, 2511213521040 is an apocalyptic number.
It is an amenable number.
511213521040 is an abundant number, since it is smaller than the sum of its proper divisors (677409830768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
511213521040 is a wasteful number, since it uses less digits than its factorization.
511213521040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279127 (or 279121 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 511213521040 its reverse (40125312115), we get a palindrome (551338833155).
The spelling of 511213521040 in words is "five hundred eleven billion, two hundred thirteen million, five hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •