Base | Representation |
---|---|
bin | 1001100011111011… |
… | …11111100110111000 |
3 | 111020202012202210201 |
4 | 10301331333212320 |
5 | 41003111132300 |
6 | 2205212251544 |
7 | 241131230425 |
oct | 46175774670 |
9 | 14222182721 |
10 | 5133302200 |
11 | 21a4684a14 |
12 | bb3170bb4 |
13 | 63a662430 |
14 | 369a80d4c |
15 | 2009d866a |
hex | 131f7f9b8 |
5133302200 has 96 divisors (see below), whose sum is σ = 13529602800. Its totient is φ = 1795599360.
The previous prime is 5133302197. The next prime is 5133302221. The reversal of 5133302200 is 22033315.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2557 + ... + 101356.
Almost surely, 25133302200 is an apocalyptic number.
5133302200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5133302200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6764801400).
5133302200 is an abundant number, since it is smaller than the sum of its proper divisors (8396300600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5133302200 is a wasteful number, since it uses less digits than its factorization.
5133302200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103961 (or 103952 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 5133302200 is about 71647.0669322897. The cubic root of 5133302200 is about 1725.0391029433.
Adding to 5133302200 its reverse (22033315), we get a palindrome (5155335515).
The spelling of 5133302200 in words is "five billion, one hundred thirty-three million, three hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •