Base | Representation |
---|---|
bin | 101101110101110110… |
… | …011111100100010001 |
3 | 11201001100121112200002 |
4 | 231311312133210101 |
5 | 1301301244001401 |
6 | 34340123135345 |
7 | 3361522621565 |
oct | 556566374421 |
9 | 151040545602 |
10 | 49221859601 |
11 | 19969502712 |
12 | 9658374555 |
13 | 48457a1815 |
14 | 254d2556a5 |
15 | 14313d9a6b |
hex | b75d9f911 |
49221859601 has 8 divisors (see below), whose sum is σ = 50549418024. Its totient is φ = 47900350080.
The previous prime is 49221859597. The next prime is 49221859627. The reversal of 49221859601 is 10695812294.
It is a happy number.
It is a Cunningham number, because it is equal to 2218602+1.
It can be written as a sum of positive squares in 4 ways, for example, as 2371690000 + 46850169601 = 48700^2 + 216449^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 49221859601 - 22 = 49221859597 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49221859651) 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, 1495730 + ... + 1528283.
It is an arithmetic number, because the mean of its divisors is an integer number (6318677253).
Almost surely, 249221859601 is an apocalyptic number.
49221859601 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
49221859601 is a deficient number, since it is larger than the sum of its proper divisors (1327558423).
49221859601 is a wasteful number, since it uses less digits than its factorization.
49221859601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3024451.
The product of its (nonzero) digits is 311040, while the sum is 47.
The spelling of 49221859601 in words is "forty-nine billion, two hundred twenty-one million, eight hundred fifty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •