Base | Representation |
---|---|
bin | 1111111000000111001… |
… | …10000000000111101000 |
3 | 1221011002022021020021002 |
4 | 13330003212000013220 |
5 | 32414211402441300 |
6 | 1054335311134132 |
7 | 54261344116661 |
oct | 7740346000750 |
9 | 1834068236232 |
10 | 545521140200 |
11 | 1a0399509923 |
12 | 89885b14348 |
13 | 3c59a0063aa |
14 | 1c590b8c368 |
15 | e2cc1b35d5 |
hex | 7f039801e8 |
545521140200 has 96 divisors (see below), whose sum is σ = 1347534343800. Its totient is φ = 204989783040.
The previous prime is 545521140181. The next prime is 545521140301. The reversal of 545521140200 is 2041125545.
It can be written as a sum of positive squares in 12 ways, for example, as 211531925476 + 333989214724 = 459926^2 + 577918^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1056419 + ... + 1485618.
Almost surely, 2545521140200 is an apocalyptic number.
545521140200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
545521140200 is an abundant number, since it is smaller than the sum of its proper divisors (802013203600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545521140200 is a wasteful number, since it uses less digits than its factorization.
545521140200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2542119 (or 2542110 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 29.
Adding to 545521140200 its reverse (2041125545), we get a palindrome (547562265745).
The spelling of 545521140200 in words is "five hundred forty-five billion, five hundred twenty-one million, one hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •