Base | Representation |
---|---|
bin | 1111001000111110011… |
… | …00011111101011111001 |
3 | 1211201202122012020111101 |
4 | 13210133030133223321 |
5 | 32010344342141100 |
6 | 1034552212131401 |
7 | 52404253354240 |
oct | 7443714375371 |
9 | 1751678166441 |
10 | 520214412025 |
11 | 190692523440 |
12 | 849a2906b61 |
13 | 3a096087819 |
14 | 1b26db9d957 |
15 | d7ea60386a |
hex | 791f31faf9 |
520214412025 has 48 divisors (see below), whose sum is σ = 807575776128. Its totient is φ = 322943616000.
The previous prime is 520214412023. The next prime is 520214412049.
It is a happy number.
520214412025 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 520214412025 - 21 = 520214412023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 520214411984 and 520214412002.
It is not an unprimeable number, because it can be changed into a prime (520214412023) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 96742 + ... + 1024591.
It is an arithmetic number, because the mean of its divisors is an integer number (16824495336).
Almost surely, 2520214412025 is an apocalyptic number.
520214412025 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
520214412025 is a deficient number, since it is larger than the sum of its proper divisors (287361364103).
520214412025 is a wasteful number, since it uses less digits than its factorization.
520214412025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121602 (or 1121597 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 28.
It can be divided in two parts, 520214 and 412025, that added together give a palindrome (932239).
The spelling of 520214412025 in words is "five hundred twenty billion, two hundred fourteen million, four hundred twelve thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •