Base | Representation |
---|---|
bin | 1001001001000110… |
… | …00011100000110011 |
3 | 110200001112011112022 |
4 | 10210203003200303 |
5 | 40022440331444 |
6 | 2131010222055 |
7 | 232425320600 |
oct | 44443034063 |
9 | 13601464468 |
10 | 4908136499 |
11 | 2099573662 |
12 | b4b88492b |
13 | 602b066a6 |
14 | 347bcb6a7 |
15 | 1dad5c9ee |
hex | 1248c3833 |
4908136499 has 6 divisors (see below), whose sum is σ = 5709464964. Its totient is φ = 4206974100.
The previous prime is 4908136459. The next prime is 4908136501. The reversal of 4908136499 is 9946318094.
It is not a de Polignac number, because 4908136499 - 216 = 4908070963 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4908136499.
It is not an unprimeable number, because it can be changed into a prime (4908136459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50082977 + ... + 50083074.
It is an arithmetic number, because the mean of its divisors is an integer number (951577494).
Almost surely, 24908136499 is an apocalyptic number.
4908136499 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
4908136499 is a deficient number, since it is larger than the sum of its proper divisors (801328465).
4908136499 is a wasteful number, since it uses less digits than its factorization.
4908136499 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100166065 (or 100166058 counting only the distinct ones).
The product of its (nonzero) digits is 1679616, while the sum is 53.
The square root of 4908136499 is about 70058.0937436925. The cubic root of 4908136499 is about 1699.4388573568.
The spelling of 4908136499 in words is "four billion, nine hundred eight million, one hundred thirty-six thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •