Base | Representation |
---|---|
bin | 11110111111101… |
… | …101010001101000 |
3 | 1100020111121012220 |
4 | 132333231101220 |
5 | 2031111021000 |
6 | 123333434040 |
7 | 15613033356 |
oct | 3677552150 |
9 | 1306447186 |
10 | 520017000 |
11 | 247599518 |
12 | 12619b920 |
13 | 83973189 |
14 | 4d0c67d6 |
15 | 309be1a0 |
hex | 1efed468 |
520017000 has 128 divisors (see below), whose sum is σ = 1640096640. Its totient is φ = 137164800.
The previous prime is 520016999. The next prime is 520017041. The reversal of 520017000 is 710025.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 290107 + ... + 291893.
It is an arithmetic number, because the mean of its divisors is an integer number (12813255).
Almost surely, 2520017000 is an apocalyptic number.
520017000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 520017000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (820048320).
520017000 is an abundant number, since it is smaller than the sum of its proper divisors (1120079640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520017000 is a wasteful number, since it uses less digits than its factorization.
520017000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1908 (or 1894 counting only the distinct ones).
The product of its (nonzero) digits is 70, while the sum is 15.
The square root of 520017000 is about 22803.8812485945. The cubic root of 520017000 is about 804.1539147426.
Adding to 520017000 its reverse (710025), we get a palindrome (520727025).
The spelling of 520017000 in words is "five hundred twenty million, seventeen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •