Base | Representation |
---|---|
bin | 11110100010000000011… |
… | …01001010000111100011 |
3 | 10201021210001011112021221 |
4 | 33101000031022013203 |
5 | 114141423044230423 |
6 | 2121532045155511 |
7 | 135535263112156 |
oct | 17210015120743 |
9 | 3637701145257 |
10 | 1049049211363 |
11 | 374998a2740a |
12 | 14b39055bb97 |
13 | 77c0406b82a |
14 | 38aba799c9d |
15 | 1c44c8eae5d |
hex | f44034a1e3 |
1049049211363 has 6 divisors (see below), whose sum is σ = 1114387916876. Its totient is φ = 987340433952.
The previous prime is 1049049211333. The next prime is 1049049211411. The reversal of 1049049211363 is 3631129409401.
It is not a de Polignac number, because 1049049211363 - 221 = 1049047114211 is a prime.
It is a super-2 number, since 2×10490492113632 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1049049211333) 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 5 ways as a sum of consecutive naturals, for example, 1814963745 + ... + 1814964322.
Almost surely, 21049049211363 is an apocalyptic number.
1049049211363 is a deficient number, since it is larger than the sum of its proper divisors (65338705513).
1049049211363 is an equidigital number, since it uses as much as digits as its factorization.
1049049211363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3629928101 (or 3629928084 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 43.
The spelling of 1049049211363 in words is "one trillion, forty-nine billion, forty-nine million, two hundred eleven thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •