Base | Representation |
---|---|
bin | 1111001001010100101… |
… | …00110001011010101101 |
3 | 1211202020122112120000200 |
4 | 13210222110301122231 |
5 | 32011240142144211 |
6 | 1035022522144113 |
7 | 52412011426041 |
oct | 7445224613255 |
9 | 1752218476020 |
10 | 520401131181 |
11 | 190778965298 |
12 | 84a35352039 |
13 | 3a0c5971b29 |
14 | 1b28a8c6021 |
15 | d80bbd7b56 |
hex | 792a5316ad |
520401131181 has 6 divisors (see below), whose sum is σ = 751690522830. Its totient is φ = 346934087448.
The previous prime is 520401131149. The next prime is 520401131183. The reversal of 520401131181 is 181131104025.
520401131181 is a `hidden beast` number, since 52 + 0 + 401 + 1 + 31 + 181 = 666.
It can be written as a sum of positive squares in only one way, i.e., 519601655556 + 799475625 = 720834^2 + 28275^2 .
It is not a de Polignac number, because 520401131181 - 25 = 520401131149 is a prime.
It is a super-2 number, since 2×5204011311812 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520401131183) 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, 28911173946 + ... + 28911173963.
It is an arithmetic number, because the mean of its divisors is an integer number (125281753805).
Almost surely, 2520401131181 is an apocalyptic number.
It is an amenable number.
520401131181 is a deficient number, since it is larger than the sum of its proper divisors (231289391649).
520401131181 is a wasteful number, since it uses less digits than its factorization.
520401131181 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57822347915 (or 57822347912 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 27.
The spelling of 520401131181 in words is "five hundred twenty billion, four hundred one million, one hundred thirty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •