Base | Representation |
---|---|
bin | 1001001110110000… |
… | …11011110011001001 |
3 | 110210100222211111101 |
4 | 10213120123303021 |
5 | 40122123342131 |
6 | 2135425301401 |
7 | 233543422300 |
oct | 44730336311 |
9 | 13710884441 |
10 | 4955684041 |
11 | 2113399850 |
12 | b63794861 |
13 | 60c913729 |
14 | 350247437 |
15 | 1e0100c61 |
hex | 12761bcc9 |
4955684041 has 24 divisors (see below), whose sum is σ = 6304072320. Its totient is φ = 3852223200.
The previous prime is 4955684039. The next prime is 4955684099. The reversal of 4955684041 is 1404865594.
It is a happy number.
It is not a de Polignac number, because 4955684041 - 21 = 4955684039 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 4955683982 and 4955684000.
It is not an unprimeable number, because it can be changed into a prime (4955684441) 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 23 ways as a sum of consecutive naturals, for example, 216000 + ... + 237838.
It is an arithmetic number, because the mean of its divisors is an integer number (262669680).
Almost surely, 24955684041 is an apocalyptic number.
It is an amenable number.
4955684041 is a deficient number, since it is larger than the sum of its proper divisors (1348388279).
4955684041 is a wasteful number, since it uses less digits than its factorization.
4955684041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22285 (or 22278 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 46.
The square root of 4955684041 is about 70396.6195282131. The cubic root of 4955684041 is about 1704.9089990216.
The spelling of 4955684041 in words is "four billion, nine hundred fifty-five million, six hundred eighty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •