Base | Representation |
---|---|
bin | 10110111000101001110111… |
… | …00000111111000110000111 |
3 | 20121012000221212012022110001 |
4 | 23130110323200333012013 |
5 | 23044011331324410043 |
6 | 255011013512142131 |
7 | 13412604433436452 |
oct | 1334247340770607 |
9 | 217160855168401 |
10 | 50325130310023 |
11 | 1504284a0a5248 |
12 | 5789420397947 |
13 | 2210840a819ca |
14 | c5da6c134499 |
15 | 5c411368174d |
hex | 2dc53b83f187 |
50325130310023 has 4 divisors (see below), whose sum is σ = 50325146321008. Its totient is φ = 50325114299040.
The previous prime is 50325130310011. The next prime is 50325130310027. The reversal of 50325130310023 is 32001303152305.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50325130310023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50325130309973 and 50325130310000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50325130310027) 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, 1561986 + ... + 10153327.
It is an arithmetic number, because the mean of its divisors is an integer number (12581286580252).
Almost surely, 250325130310023 is an apocalyptic number.
50325130310023 is a deficient number, since it is larger than the sum of its proper divisors (16010985).
50325130310023 is a wasteful number, since it uses less digits than its factorization.
50325130310023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16010984.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 50325130310023 its reverse (32001303152305), we get a palindrome (82326433462328).
The spelling of 50325130310023 in words is "fifty trillion, three hundred twenty-five billion, one hundred thirty million, three hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •