Base | Representation |
---|---|
bin | 10110111001001010000101… |
… | …10010100000000101111011 |
3 | 20121020200121122202222002022 |
4 | 23130211002302200011323 |
5 | 23044302300121230243 |
6 | 255022554420025055 |
7 | 13414056254246420 |
oct | 1334450262400573 |
9 | 217220548688068 |
10 | 50342432211323 |
11 | 1504a11861682a |
12 | 579084a83218b |
13 | 221236a48a425 |
14 | c6082dd5dd47 |
15 | 5c47c75e0b68 |
hex | 2dc942ca017b |
50342432211323 has 8 divisors (see below), whose sum is σ = 57539027351040. Its totient is φ = 43147041849000.
The previous prime is 50342432211287. The next prime is 50342432211349. The reversal of 50342432211323 is 32311223424305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50342432211323 - 226 = 50342365102459 is a prime.
It is a super-3 number, since 3×503424322113233 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50342432211353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 301104803 + ... + 301271948.
It is an arithmetic number, because the mean of its divisors is an integer number (7192378418880).
Almost surely, 250342432211323 is an apocalyptic number.
50342432211323 is a deficient number, since it is larger than the sum of its proper divisors (7196595139717).
50342432211323 is a wasteful number, since it uses less digits than its factorization.
50342432211323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602388697.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 50342432211323 its reverse (32311223424305), we get a palindrome (82653655635628).
The spelling of 50342432211323 in words is "fifty trillion, three hundred forty-two billion, four hundred thirty-two million, two hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •