Base | Representation |
---|---|
bin | 1001001000010110… |
… | …00010100100000101 |
3 | 110122121200022221111 |
4 | 10210023002210011 |
5 | 40014332404112 |
6 | 2130223245021 |
7 | 232320651043 |
oct | 44413024405 |
9 | 13577608844 |
10 | 4901841157 |
11 | 2095a638a4 |
12 | b49749771 |
13 | 601711135 |
14 | 34702d393 |
15 | 1da5175a7 |
hex | 1242c2905 |
4901841157 has 8 divisors (see below), whose sum is σ = 5062748184. Its totient is φ = 4743468288.
The previous prime is 4901841143. The next prime is 4901841193. The reversal of 4901841157 is 7511481094.
It can be written as a sum of positive squares in 4 ways, for example, as 521254561 + 4380586596 = 22831^2 + 66186^2 .
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 4901841157 - 215 = 4901808389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4901841137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 629608 + ... + 637345.
It is an arithmetic number, because the mean of its divisors is an integer number (632843523).
Almost surely, 24901841157 is an apocalyptic number.
It is an amenable number.
4901841157 is a deficient number, since it is larger than the sum of its proper divisors (160907027).
4901841157 is a wasteful number, since it uses less digits than its factorization.
4901841157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267079.
The product of its (nonzero) digits is 40320, while the sum is 40.
The square root of 4901841157 is about 70013.1498862892. The cubic root of 4901841157 is about 1698.7119605541.
The spelling of 4901841157 in words is "four billion, nine hundred one million, eight hundred forty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •