Base | Representation |
---|---|
bin | 101111101000001100… |
… | …001110111110001111 |
3 | 11220000001020101001201 |
4 | 233220030032332033 |
5 | 1314213340131143 |
6 | 35254331050331 |
7 | 3460205125351 |
oct | 575014167617 |
9 | 156001211051 |
10 | 51140161423 |
11 | 1a76331921a |
12 | 9ab28a09a7 |
13 | 4a90042860 |
14 | 2691d250d1 |
15 | 14e4a1064d |
hex | be830ef8f |
51140161423 has 32 divisors (see below), whose sum is σ = 56729675520. Its totient is φ = 45810385920.
The previous prime is 51140161399. The next prime is 51140161439. The reversal of 51140161423 is 32416104115.
It is not a de Polignac number, because 51140161423 - 213 = 51140153231 is a prime.
It is a super-2 number, since 2×511401614232 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51140161391 and 51140161400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51140161453) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43671628 + ... + 43672798.
It is an arithmetic number, because the mean of its divisors is an integer number (1772802360).
Almost surely, 251140161423 is an apocalyptic number.
51140161423 is a deficient number, since it is larger than the sum of its proper divisors (5589514097).
51140161423 is a wasteful number, since it uses less digits than its factorization.
51140161423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1927.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 51140161423 its reverse (32416104115), we get a palindrome (83556265538).
The spelling of 51140161423 in words is "fifty-one billion, one hundred forty million, one hundred sixty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •