Base | Representation |
---|---|
bin | 101110010100000100… |
… | …001110100111101001 |
3 | 11202100200110121011202 |
4 | 232110010032213221 |
5 | 1303321031323211 |
6 | 34502312133545 |
7 | 3410216425133 |
oct | 562404164751 |
9 | 152320417152 |
10 | 49728776681 |
11 | 1a0a9663a51 |
12 | 977a0972b5 |
13 | 48c680915c |
14 | 259a6cc053 |
15 | 1460b6c53b |
hex | b9410e9e9 |
49728776681 has 8 divisors (see below), whose sum is σ = 50214021000. Its totient is φ = 49244060160.
The previous prime is 49728776677. The next prime is 49728776683. The reversal of 49728776681 is 18667782794.
It can be written as a sum of positive squares in 4 ways, for example, as 2440360000 + 47288416681 = 49400^2 + 217459^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 49728776681 - 22 = 49728776677 is a prime.
It is a super-2 number, since 2×497287766812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49728776683) 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 7 ways as a sum of consecutive naturals, for example, 58745 + ... + 320793.
It is an arithmetic number, because the mean of its divisors is an integer number (6276752625).
Almost surely, 249728776681 is an apocalyptic number.
It is an amenable number.
49728776681 is a deficient number, since it is larger than the sum of its proper divisors (485244319).
49728776681 is a wasteful number, since it uses less digits than its factorization.
49728776681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263899.
The product of its digits is 56899584, while the sum is 65.
The spelling of 49728776681 in words is "forty-nine billion, seven hundred twenty-eight million, seven hundred seventy-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •