Base | Representation |
---|---|
bin | 1001111000101101… |
… | …11100100001110100 |
3 | 111200220012210111020 |
4 | 10330112330201310 |
5 | 41332222142343 |
6 | 2234400341140 |
7 | 245345662140 |
oct | 47426744164 |
9 | 14626183436 |
10 | 5307615348 |
11 | 2284012a72 |
12 | 10416147b0 |
13 | 6677c49c9 |
14 | 384c98220 |
15 | 210e6bb83 |
hex | 13c5bc874 |
5307615348 has 48 divisors (see below), whose sum is σ = 14299576704. Its totient is φ = 1500825600.
The previous prime is 5307615343. The next prime is 5307615349. The reversal of 5307615348 is 8435167035.
It is a super-2 number, since 2×53076153482 = 56341561364650322208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5307615343) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 317553 + ... + 333848.
It is an arithmetic number, because the mean of its divisors is an integer number (297907848).
Almost surely, 25307615348 is an apocalyptic number.
It is an amenable number.
5307615348 is an abundant number, since it is smaller than the sum of its proper divisors (8991961356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5307615348 is a wasteful number, since it uses less digits than its factorization.
5307615348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651512 (or 651510 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The square root of 5307615348 is about 72853.3825432972. The cubic root of 5307615348 is about 1744.3480620883.
The spelling of 5307615348 in words is "five billion, three hundred seven million, six hundred fifteen thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •