Base | Representation |
---|---|
bin | 1000111101001011… |
… | …00000101110010001 |
3 | 110102002022122202111 |
4 | 10132211200232101 |
5 | 34321334222022 |
6 | 2113034345321 |
7 | 230102215135 |
oct | 43645405621 |
9 | 13362278674 |
10 | 4808117137 |
11 | 204806962a |
12 | b2228b241 |
13 | 5b8187135 |
14 | 3387d33c5 |
15 | 1d21a2477 |
hex | 11e960b91 |
4808117137 has 2 divisors, whose sum is σ = 4808117138. Its totient is φ = 4808117136.
The previous prime is 4808117131. The next prime is 4808117201. The reversal of 4808117137 is 7317118084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3903250576 + 904866561 = 62476^2 + 30081^2 .
It is a cyclic number.
It is not a de Polignac number, because 4808117137 - 211 = 4808115089 is a prime.
It is a super-3 number, since 3×48081171373 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 4808117137.
It is not a weakly prime, because it can be changed into another prime (4808117131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2404058568 + 2404058569.
It is an arithmetic number, because the mean of its divisors is an integer number (2404058569).
Almost surely, 24808117137 is an apocalyptic number.
It is an amenable number.
4808117137 is a deficient number, since it is larger than the sum of its proper divisors (1).
4808117137 is an equidigital number, since it uses as much as digits as its factorization.
4808117137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37632, while the sum is 40.
The square root of 4808117137 is about 69340.5879481852. The cubic root of 4808117137 is about 1687.8156643463.
The spelling of 4808117137 in words is "four billion, eight hundred eight million, one hundred seventeen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •