Base | Representation |
---|---|
bin | 100100000000101000010… |
… | …1111011110011000100001 |
3 | 122112010122020221110011021 |
4 | 1020001100233132120201 |
5 | 1122041333134304424 |
6 | 14305340013245441 |
7 | 1020364502642266 |
oct | 110012057363041 |
9 | 18463566843137 |
10 | 4949156947489 |
11 | 1638a200886a7 |
12 | 67b21a793881 |
13 | 29b91b779601 |
14 | 13177d0c126d |
15 | 88b13d4d4e4 |
hex | 48050bde621 |
4949156947489 has 4 divisors (see below), whose sum is σ = 4975068764160. Its totient is φ = 4923245130820.
The previous prime is 4949156947487. The next prime is 4949156947507. The reversal of 4949156947489 is 9847496519494.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4949156947489 - 21 = 4949156947487 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4949156947487) 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 3 ways as a sum of consecutive naturals, for example, 12955908049 + ... + 12955908430.
It is an arithmetic number, because the mean of its divisors is an integer number (1243767191040).
Almost surely, 24949156947489 is an apocalyptic number.
It is an amenable number.
4949156947489 is a deficient number, since it is larger than the sum of its proper divisors (25911816671).
4949156947489 is a wasteful number, since it uses less digits than its factorization.
4949156947489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25911816670.
The product of its digits is 2821754880, while the sum is 79.
The spelling of 4949156947489 in words is "four trillion, nine hundred forty-nine billion, one hundred fifty-six million, nine hundred forty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •