Base | Representation |
---|---|
bin | 1001100101100000… |
… | …00111010111110000 |
3 | 111021122221022010100 |
4 | 10302300013113300 |
5 | 41014442104300 |
6 | 2210402032400 |
7 | 241351012515 |
oct | 46260072760 |
9 | 14248838110 |
10 | 5146441200 |
11 | 220103949a |
12 | bb7648700 |
13 | 6402b29a4 |
14 | 36b70130c |
15 | 201c31700 |
hex | 132c075f0 |
5146441200 has 90 divisors (see below), whose sum is σ = 17859593024. Its totient is φ = 1372383360.
The previous prime is 5146441189. The next prime is 5146441211. The reversal of 5146441200 is 21446415.
5146441200 is a `hidden beast` number, since 5 + 1 + 4 + 644 + 12 + 0 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (5146441189) and next prime (5146441211).
It is a tau number, because it is divible by the number of its divisors (90).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 711184 + ... + 718383.
Almost surely, 25146441200 is an apocalyptic number.
5146441200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5146441200 is an abundant number, since it is smaller than the sum of its proper divisors (12713151824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5146441200 is a wasteful number, since it uses less digits than its factorization.
5146441200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429591 (or 1429577 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 5146441200 is about 71738.7008524687. The cubic root of 5146441200 is about 1726.5096299461.
Adding to 5146441200 its reverse (21446415), we get a palindrome (5167887615).
The spelling of 5146441200 in words is "five billion, one hundred forty-six million, four hundred forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •