Base | Representation |
---|---|
bin | 10110111100110001011010… |
… | …00001111101000110100111 |
3 | 20121200120011121022000112101 |
4 | 23132120231001331012213 |
5 | 23103321120012341033 |
6 | 255200013513232531 |
7 | 13426043630334100 |
oct | 1336305501750647 |
9 | 217616147260471 |
10 | 50466621215143 |
11 | 15097857017481 |
12 | 57b0929402747 |
13 | 2220c9c4a0383 |
14 | c668517793a7 |
15 | 5c7b4520297d |
hex | 2de62d07d1a7 |
50466621215143 has 12 divisors (see below), whose sum is σ = 58707588774600. Its totient is φ = 43255984489872.
The previous prime is 50466621215117. The next prime is 50466621215147. The reversal of 50466621215143 is 34151212666405.
It is not a de Polignac number, because 50466621215143 - 29 = 50466621214631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50466621215093 and 50466621215102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50466621215147) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11410696 + ... + 15203197.
It is an arithmetic number, because the mean of its divisors is an integer number (4892299064550).
Almost surely, 250466621215143 is an apocalyptic number.
50466621215143 is a deficient number, since it is larger than the sum of its proper divisors (8240967559457).
50466621215143 is a wasteful number, since it uses less digits than its factorization.
50466621215143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26652606 (or 26652599 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 50466621215143 in words is "fifty trillion, four hundred sixty-six billion, six hundred twenty-one million, two hundred fifteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •