Base | Representation |
---|---|
bin | 10111010010011010010011… |
… | …10111000111001000101011 |
3 | 20201022122022022020211021121 |
4 | 23221031021313013020223 |
5 | 23203011323332112443 |
6 | 300525335542120111 |
7 | 13533544603025425 |
oct | 1351151167071053 |
9 | 221278268224247 |
10 | 51210134254123 |
11 | 15354106817309 |
12 | 58b0a4a420037 |
13 | 2276130773050 |
14 | c90825a41815 |
15 | 5dc15e3c74ed |
hex | 2e9349dc722b |
51210134254123 has 8 divisors (see below), whose sum is σ = 56189929603248. Its totient is φ = 46378989512544.
The previous prime is 51210134254099. The next prime is 51210134254183. The reversal of 51210134254123 is 32145243101215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-51210134254123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51210134254183) 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, 37162651165 + ... + 37162652542.
It is an arithmetic number, because the mean of its divisors is an integer number (7023741200406).
Almost surely, 251210134254123 is an apocalyptic number.
51210134254123 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
51210134254123 is a deficient number, since it is larger than the sum of its proper divisors (4979795349125).
51210134254123 is a wasteful number, since it uses less digits than its factorization.
51210134254123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74325303773.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 51210134254123 its reverse (32145243101215), we get a palindrome (83355377355338).
The spelling of 51210134254123 in words is "fifty-one trillion, two hundred ten billion, one hundred thirty-four million, two hundred fifty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •