Base | Representation |
---|---|
bin | 10000000111010110110… |
… | …00111101010011011000 |
3 | 1221221012122122111102002 |
4 | 20003223120331103120 |
5 | 33032441440032300 |
6 | 1102211335500132 |
7 | 55001216601650 |
oct | 10035330752330 |
9 | 1857178574362 |
10 | 553705002200 |
11 | 1a3909047539 |
12 | 8b38a827648 |
13 | 402a267319c |
14 | 1cb29a37360 |
15 | e60a8cb5d5 |
hex | 80eb63d4d8 |
553705002200 has 48 divisors (see below), whose sum is σ = 1471273295280. Its totient is φ = 189841714560.
The previous prime is 553705002181. The next prime is 553705002247. The reversal of 553705002200 is 2200507355.
It is a super-2 number, since 2×5537050022002 (a number of 24 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 197750387 + ... + 197753186.
It is an arithmetic number, because the mean of its divisors is an integer number (30651526985).
Almost surely, 2553705002200 is an apocalyptic number.
553705002200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
553705002200 is an abundant number, since it is smaller than the sum of its proper divisors (917568293080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
553705002200 is a wasteful number, since it uses less digits than its factorization.
553705002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395503596 (or 395503587 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 29.
Adding to 553705002200 its reverse (2200507355), we get a palindrome (555905509555).
The spelling of 553705002200 in words is "five hundred fifty-three billion, seven hundred five million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •