Base | Representation |
---|---|
bin | 1110101101000001110… |
… | …00000011001010010000 |
3 | 1210022000222011101002002 |
4 | 13112200320003022100 |
5 | 31234132304034300 |
6 | 1024031304213132 |
7 | 51333403011536 |
oct | 7264070031220 |
9 | 1708028141062 |
10 | 505210221200 |
11 | 185292aa9833 |
12 | 81ab5a6a1a8 |
13 | 388447020b9 |
14 | 1a6491a8156 |
15 | d21d2625d5 |
hex | 75a0e03290 |
505210221200 has 30 divisors (see below), whose sum is σ = 1213767557394. Its totient is φ = 202084088320.
The previous prime is 505210221157. The next prime is 505210221203. The reversal of 505210221200 is 2122012505.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 169862676736 + 335347544464 = 412144^2 + 579092^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (505210221203) 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, 631512377 + ... + 631513176.
Almost surely, 2505210221200 is an apocalyptic number.
505210221200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
505210221200 is an abundant number, since it is smaller than the sum of its proper divisors (708557336194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505210221200 is a wasteful number, since it uses less digits than its factorization.
505210221200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263025571 (or 1263025560 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
Adding to 505210221200 its reverse (2122012505), we get a palindrome (507332233705).
The spelling of 505210221200 in words is "five hundred five billion, two hundred ten million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •