Base | Representation |
---|---|
bin | 101111101000110111… |
… | …111010010001111101 |
3 | 11220000211210001221022 |
4 | 233220313322101331 |
5 | 1314224303023010 |
6 | 35255420313525 |
7 | 3460404343145 |
oct | 575067722175 |
9 | 156024701838 |
10 | 51151611005 |
11 | 1a769829490 |
12 | 9ab66a28a5 |
13 | 4a92521161 |
14 | 2693665925 |
15 | 14e5a22d55 |
hex | be8dfa47d |
51151611005 has 16 divisors (see below), whose sum is σ = 66966770304. Its totient is φ = 37198582080.
The previous prime is 51151610989. The next prime is 51151611011. The reversal of 51151611005 is 50011615115.
It is not a de Polignac number, because 51151611005 - 24 = 51151610989 is a prime.
It is a super-2 number, since 2×511516110052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1161824 + ... + 1205046.
It is an arithmetic number, because the mean of its divisors is an integer number (4185423144).
Almost surely, 251151611005 is an apocalyptic number.
51151611005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
51151611005 is a deficient number, since it is larger than the sum of its proper divisors (15815159299).
51151611005 is a wasteful number, since it uses less digits than its factorization.
51151611005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64756.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 51151611005 in words is "fifty-one billion, one hundred fifty-one million, six hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •