Base | Representation |
---|---|
bin | 1001110001000011… |
… | …11001001000010111 |
3 | 111112102100002212201 |
4 | 10320201321020113 |
5 | 41214301014101 |
6 | 2224143425331 |
7 | 243635650636 |
oct | 47041711027 |
9 | 14472302781 |
10 | 5243376151 |
11 | 2250827122 |
12 | 1023bb5247 |
13 | 6573c2350 |
14 | 37a53551d |
15 | 20a4cce01 |
hex | 138879217 |
5243376151 has 8 divisors (see below), whose sum is σ = 5660799984. Its totient is φ = 4827964800.
The previous prime is 5243376133. The next prime is 5243376169. The reversal of 5243376151 is 1516733425.
It is an interprime number because it is at equal distance from previous prime (5243376133) and next prime (5243376169).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5243376151 - 27 = 5243376023 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5243376151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5243376101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 497701 + ... + 508126.
It is an arithmetic number, because the mean of its divisors is an integer number (707599998).
Almost surely, 25243376151 is an apocalyptic number.
5243376151 is a deficient number, since it is larger than the sum of its proper divisors (417423833).
5243376151 is a wasteful number, since it uses less digits than its factorization.
5243376151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006241.
The product of its digits is 75600, while the sum is 37.
The square root of 5243376151 is about 72411.1604036284. The cubic root of 5243376151 is about 1737.2820727382.
The spelling of 5243376151 in words is "five billion, two hundred forty-three million, three hundred seventy-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •