Base | Representation |
---|---|
bin | 10111001111100000000011… |
… | …11011111011100101000101 |
3 | 20200222002012202122120120021 |
4 | 23213300001323323211011 |
5 | 23144342033141411044 |
6 | 300411401541135141 |
7 | 13523404666025350 |
oct | 1347600173734505 |
9 | 220862182576507 |
10 | 51110143310149 |
11 | 15315765507130 |
12 | 58955a36ba4b1 |
13 | 2269886ab4601 |
14 | c89a5bc9b297 |
15 | 5d975ad7ae84 |
hex | 2e7c01efb945 |
51110143310149 has 16 divisors (see below), whose sum is σ = 63848420536320. Its totient is φ = 39746908557360.
The previous prime is 51110143310147. The next prime is 51110143310159. The reversal of 51110143310149 is 94101334101115.
It is a cyclic number.
It is not a de Polignac number, because 51110143310149 - 21 = 51110143310147 is a prime.
It is a super-2 number, since 2×511101433101492 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51110143310147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 659770509 + ... + 659847970.
It is an arithmetic number, because the mean of its divisors is an integer number (3990526283520).
Almost surely, 251110143310149 is an apocalyptic number.
It is an amenable number.
51110143310149 is a deficient number, since it is larger than the sum of its proper divisors (12738277226171).
51110143310149 is a wasteful number, since it uses less digits than its factorization.
51110143310149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319619000.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 51110143310149 in words is "fifty-one trillion, one hundred ten billion, one hundred forty-three million, three hundred ten thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •