Base | Representation |
---|---|
bin | 101101110000100101… |
… | …001011000101101001 |
3 | 11200211012020000102221 |
4 | 231300211023011221 |
5 | 1301111124330233 |
6 | 34323243554041 |
7 | 3356400201625 |
oct | 556045130551 |
9 | 150735200387 |
10 | 49133433193 |
11 | 199235a6639 |
12 | 963282b921 |
13 | 4830380bc0 |
14 | 25415d8185 |
15 | 142876e42d |
hex | b7094b169 |
49133433193 has 8 divisors (see below), whose sum is σ = 54737512200. Its totient is φ = 43790009088.
The previous prime is 49133433191. The next prime is 49133433197. The reversal of 49133433193 is 39133433194.
It can be written as a sum of positive squares in 4 ways, for example, as 14462809 + 49118970384 = 3803^2 + 221628^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 49133433193 - 21 = 49133433191 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49133433191) 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, 65163328 + ... + 65164081.
It is an arithmetic number, because the mean of its divisors is an integer number (6842189025).
Almost surely, 249133433193 is an apocalyptic number.
It is an amenable number.
49133433193 is a deficient number, since it is larger than the sum of its proper divisors (5604079007).
49133433193 is a wasteful number, since it uses less digits than its factorization.
49133433193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130327451.
The product of its digits is 314928, while the sum is 43.
Subtracting from 49133433193 its reverse (39133433194), we obtain a palindrome (9999999999).
The spelling of 49133433193 in words is "forty-nine billion, one hundred thirty-three million, four hundred thirty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •