Base | Representation |
---|---|
bin | 1111001000110100011… |
… | …11000111001011100000 |
3 | 1211201112211122020111222 |
4 | 13210122033013023200 |
5 | 32010212042241000 |
6 | 1034540040554212 |
7 | 52402223232461 |
oct | 7443217071340 |
9 | 1751484566458 |
10 | 520131212000 |
11 | 19064a566a94 |
12 | 8497aa82968 |
13 | 3a081a76a3a |
14 | 1b262b02d68 |
15 | d7e316ba85 |
hex | 791a3c72e0 |
520131212000 has 48 divisors (see below), whose sum is σ = 1277962397712. Its totient is φ = 208052483200.
The previous prime is 520131211979. The next prime is 520131212011. The reversal of 520131212000 is 212131025.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 520131212000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65012402 + ... + 65020401.
It is an arithmetic number, because the mean of its divisors is an integer number (26624216619).
Almost surely, 2520131212000 is an apocalyptic number.
520131212000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
520131212000 is an abundant number, since it is smaller than the sum of its proper divisors (757831185712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520131212000 is a wasteful number, since it uses less digits than its factorization.
520131212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130032828 (or 130032810 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 520131212000 its reverse (212131025), we get a palindrome (520343343025).
The spelling of 520131212000 in words is "five hundred twenty billion, one hundred thirty-one million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •