Base | Representation |
---|---|
bin | 1111001001100101110… |
… | …00011011101100110010 |
3 | 1211202121122200110111100 |
4 | 13210302320123230302 |
5 | 32012033420302023 |
6 | 1035045051225230 |
7 | 52415403630504 |
oct | 7446270335462 |
9 | 1752548613440 |
10 | 520544697138 |
11 | 190841a02544 |
12 | 84a75448216 |
13 | 3a11962a2bb |
14 | 1b2a19b7d74 |
15 | d8195e5c43 |
hex | 7932e1bb32 |
520544697138 has 12 divisors (see below), whose sum is σ = 1127846843838. Its totient is φ = 173514899040.
The previous prime is 520544697097. The next prime is 520544697139. The reversal of 520544697138 is 831796445025.
It is a happy number.
520544697138 is a `hidden beast` number, since 5 + 2 + 0 + 544 + 6 + 97 + 1 + 3 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 494486020809 + 26058676329 = 703197^2 + 161427^2 .
It is a super-3 number, since 3×5205446971383 (a number of 36 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (520544697139) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14459574903 + ... + 14459574938.
It is a 1-persistent number, because it is pandigital, but 2⋅520544697138 = 1041089394276 is not.
Almost surely, 2520544697138 is an apocalyptic number.
520544697138 is an abundant number, since it is smaller than the sum of its proper divisors (607302146700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520544697138 is a wasteful number, since it uses less digits than its factorization.
520544697138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28919149849 (or 28919149846 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 54.
The spelling of 520544697138 in words is "five hundred twenty billion, five hundred forty-four million, six hundred ninety-seven thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •