Base | Representation |
---|---|
bin | 11111000001001… |
… | …100100010100111 |
3 | 1100021020102111000 |
4 | 133001030202213 |
5 | 2031211012312 |
6 | 123350044343 |
7 | 15616250115 |
oct | 3701144247 |
9 | 1307212430 |
10 | 520407207 |
11 | 247835701 |
12 | 1263496b3 |
13 | 83a7b978 |
14 | 4d188ab5 |
15 | 30a49adc |
hex | 1f04c8a7 |
520407207 has 32 divisors (see below), whose sum is σ = 821888000. Its totient is φ = 324492480.
The previous prime is 520407197. The next prime is 520407229. The reversal of 520407207 is 702704025.
520407207 is a `hidden beast` number, since 52 + 0 + 407 + 207 = 666.
It is not a de Polignac number, because 520407207 - 26 = 520407143 is a prime.
It is a super-2 number, since 2×5204072072 = 541647322195081698, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520407607) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34107 + ... + 46947.
It is an arithmetic number, because the mean of its divisors is an integer number (25684000).
Almost surely, 2520407207 is an apocalyptic number.
520407207 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
520407207 is a deficient number, since it is larger than the sum of its proper divisors (301480793).
520407207 is a wasteful number, since it uses less digits than its factorization.
520407207 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12948 (or 12942 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 27.
The square root of 520407207 is about 22812.4353588125. The cubic root of 520407207 is about 804.3550030619.
The spelling of 520407207 in words is "five hundred twenty million, four hundred seven thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •