Base | Representation |
---|---|
bin | 100100101111101001111… |
… | …1111100101110100001111 |
3 | 122212210022011110101222202 |
4 | 1021133103333211310033 |
5 | 1130220143132012333 |
6 | 14424000452032115 |
7 | 1030601154141503 |
oct | 111372377456417 |
9 | 18783264411882 |
10 | 5050143235343 |
11 | 1677832221428 |
12 | 69690290263b |
13 | 2a82c3704b1b |
14 | 1365dd120303 |
15 | 8b57495b5e8 |
hex | 497d3fe5d0f |
5050143235343 has 4 divisors (see below), whose sum is σ = 5110988334648. Its totient is φ = 4989298136040.
The previous prime is 5050143235303. The next prime is 5050143235399. The reversal of 5050143235343 is 3435323410505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5050143235343 - 26 = 5050143235279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5050143235297 and 5050143235306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5050143235303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30422549528 + ... + 30422549693.
It is an arithmetic number, because the mean of its divisors is an integer number (1277747083662).
Almost surely, 25050143235343 is an apocalyptic number.
5050143235343 is a deficient number, since it is larger than the sum of its proper divisors (60845099305).
5050143235343 is an equidigital number, since it uses as much as digits as its factorization.
5050143235343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60845099304.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 5050143235343 its reverse (3435323410505), we get a palindrome (8485466645848).
The spelling of 5050143235343 in words is "five trillion, fifty billion, one hundred forty-three million, two hundred thirty-five thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •