Base | Representation |
---|---|
bin | 10110011101111111010111… |
… | …01111011100010100001101 |
3 | 20110221110011122102220212012 |
4 | 23032333223233130110031 |
5 | 22434004024223412042 |
6 | 253030055322151005 |
7 | 13256452120362401 |
oct | 1316775357342415 |
9 | 213843148386765 |
10 | 49408963888397 |
11 | 1481a251031623 |
12 | 565b956052465 |
13 | 2175325c11059 |
14 | c2b599a59101 |
15 | 5aa391c38e82 |
hex | 2cefebbdc50d |
49408963888397 has 8 divisors (see below), whose sum is σ = 51003754817280. Its totient is φ = 47814232546080.
The previous prime is 49408963888387. The next prime is 49408963888429. The reversal of 49408963888397 is 79388836980494.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49408963888397 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 (49408963888337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13208447 + ... + 16531212.
It is an arithmetic number, because the mean of its divisors is an integer number (6375469352160).
Almost surely, 249408963888397 is an apocalyptic number.
It is an amenable number.
49408963888397 is a deficient number, since it is larger than the sum of its proper divisors (1594790928883).
49408963888397 is a wasteful number, since it uses less digits than its factorization.
49408963888397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29793283.
The product of its (nonzero) digits is 18059231232, while the sum is 86.
The spelling of 49408963888397 in words is "forty-nine trillion, four hundred eight billion, nine hundred sixty-three million, eight hundred eighty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •