Base | Representation |
---|---|
bin | 1001100101011101… |
… | …11010010000011101 |
3 | 111021122100020211212 |
4 | 10302232322100131 |
5 | 41014402002331 |
6 | 2210351154205 |
7 | 241345225610 |
oct | 46256722035 |
9 | 14248306755 |
10 | 5146125341 |
11 | 2200943155 |
12 | bb7515965 |
13 | 640201ca6 |
14 | 36b65c177 |
15 | 201bbcd2b |
hex | 132bba41d |
5146125341 has 8 divisors (see below), whose sum is σ = 5882897280. Its totient is φ = 4409756208.
The previous prime is 5146125329. The next prime is 5146125343. The reversal of 5146125341 is 1435216415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5146125341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5146125298 and 5146125307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5146125343) 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 7 ways as a sum of consecutive naturals, for example, 72806 + ... + 124871.
It is an arithmetic number, because the mean of its divisors is an integer number (735362160).
Almost surely, 25146125341 is an apocalyptic number.
It is an amenable number.
5146125341 is a deficient number, since it is larger than the sum of its proper divisors (736771939).
5146125341 is a wasteful number, since it uses less digits than its factorization.
5146125341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201403.
The product of its digits is 14400, while the sum is 32.
The square root of 5146125341 is about 71736.4993639918. The cubic root of 5146125341 is about 1726.4743081421.
The spelling of 5146125341 in words is "five billion, one hundred forty-six million, one hundred twenty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •