Base | Representation |
---|---|
bin | 1001111000001011… |
… | …11000101100110000 |
3 | 111200120210120212201 |
4 | 10330011320230300 |
5 | 41330101040331 |
6 | 2234120432544 |
7 | 245262654640 |
oct | 47405705460 |
9 | 14616716781 |
10 | 5303143216 |
11 | 2281538a98 |
12 | 1040018754 |
13 | 6668ba287 |
14 | 384452520 |
15 | 210886a61 |
hex | 13c178b30 |
5303143216 has 80 divisors (see below), whose sum is σ = 12403714048. Its totient is φ = 2148249600.
The previous prime is 5303143213. The next prime is 5303143243. The reversal of 5303143216 is 6123413035.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (5303143213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131536 + ... + 167056.
Almost surely, 25303143216 is an apocalyptic number.
5303143216 is a gapful number since it is divisible by the number (56) 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 5303143216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6201857024).
5303143216 is an abundant number, since it is smaller than the sum of its proper divisors (7100570832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5303143216 is a wasteful number, since it uses less digits than its factorization.
5303143216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35610 (or 35604 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 5303143216 is about 72822.6833891748. The cubic root of 5303143216 is about 1743.8580022844.
The spelling of 5303143216 in words is "five billion, three hundred three million, one hundred forty-three thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •