Base | Representation |
---|---|
bin | 101111111001000101… |
… | …100011111111001101 |
3 | 11220201210121211012211 |
4 | 233321011203333031 |
5 | 1320303422001130 |
6 | 35342414430421 |
7 | 3500216413303 |
oct | 577105437715 |
9 | 156653554184 |
10 | 51423625165 |
11 | 1a899328780 |
12 | 9b71802411 |
13 | 4b069a0993 |
14 | 26bb832273 |
15 | 150e854a2a |
hex | bf9163fcd |
51423625165 has 8 divisors (see below), whose sum is σ = 67318200288. Its totient is φ = 37399000080.
The previous prime is 51423625163. The next prime is 51423625171. The reversal of 51423625165 is 56152632415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51423625165 - 21 = 51423625163 is a prime.
It is a super-2 number, since 2×514236251652 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51423625163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 467487447 + ... + 467487556.
It is an arithmetic number, because the mean of its divisors is an integer number (8414775036).
Almost surely, 251423625165 is an apocalyptic number.
51423625165 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
51423625165 is a deficient number, since it is larger than the sum of its proper divisors (15894575123).
51423625165 is a wasteful number, since it uses less digits than its factorization.
51423625165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934975019.
The product of its digits is 216000, while the sum is 40.
The spelling of 51423625165 in words is "fifty-one billion, four hundred twenty-three million, six hundred twenty-five thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •