Base | Representation |
---|---|
bin | 100000111001101… |
… | …110001000110100 |
3 | 1102110200121112020 |
4 | 200321232020310 |
5 | 2112303031400 |
6 | 130435153140 |
7 | 16451640366 |
oct | 4071561064 |
9 | 1373617466 |
10 | 552002100 |
11 | 263655391 |
12 | 134a457b0 |
13 | 8a491880 |
14 | 53450d36 |
15 | 336db2a0 |
hex | 20e6e234 |
552002100 has 72 divisors (see below), whose sum is σ = 1719994080. Its totient is φ = 135876480.
The previous prime is 552002063. The next prime is 552002107. The reversal of 552002100 is 1200255.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 552002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552002107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 66870 + ... + 74669.
Almost surely, 2552002100 is an apocalyptic number.
552002100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
552002100 is an abundant number, since it is smaller than the sum of its proper divisors (1167991980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552002100 is a wasteful number, since it uses less digits than its factorization.
552002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141569 (or 141562 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 552002100 is about 23494.7249398668. The cubic root of 552002100 is about 820.3142261914.
Adding to 552002100 its reverse (1200255), we get a palindrome (553202355).
The spelling of 552002100 in words is "five hundred fifty-two million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •