Base | Representation |
---|---|
bin | 10110011110100110011011… |
… | …11111110100100101111111 |
3 | 20111000110022111010122220210 |
4 | 23033103031333310211333 |
5 | 22434330004030432033 |
6 | 253043444550443503 |
7 | 13261123662014340 |
oct | 1317231577644577 |
9 | 214013274118823 |
10 | 49429939702143 |
11 | 14828135364990 |
12 | 5663a2a963593 |
13 | 21772b9808170 |
14 | c2c5c97940c7 |
15 | 5aabbd4a9d63 |
hex | 2cf4cdff497f |
49429939702143 has 256 divisors, whose sum is σ = 96008255078400. Its totient is φ = 21775848192000.
The previous prime is 49429939702103. The next prime is 49429939702177. The reversal of 49429939702143 is 34120793992494.
It is not a de Polignac number, because 49429939702143 - 210 = 49429939701119 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49429939702103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 247013853 + ... + 247213881.
It is an arithmetic number, because the mean of its divisors is an integer number (375032246400).
Almost surely, 249429939702143 is an apocalyptic number.
49429939702143 is a deficient number, since it is larger than the sum of its proper divisors (46578315376257).
49429939702143 is a wasteful number, since it uses less digits than its factorization.
49429939702143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200214.
The product of its (nonzero) digits is 105815808, while the sum is 66.
The spelling of 49429939702143 in words is "forty-nine trillion, four hundred twenty-nine billion, nine hundred thirty-nine million, seven hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •