Base | Representation |
---|---|
bin | 10111011110000110001001… |
… | …00101111100110001001010 |
3 | 20202202000121220111202012112 |
4 | 23233003010211330301022 |
5 | 23231101102034430211 |
6 | 301434015304542322 |
7 | 13604550121510064 |
oct | 1357030445746112 |
9 | 222660556452175 |
10 | 51611625311306 |
11 | 15499404a80a75 |
12 | 5956818a819a2 |
13 | 22a4c55c92038 |
14 | ca6031c5a734 |
15 | 5e780bb5088b |
hex | 2ef0c497cc4a |
51611625311306 has 8 divisors (see below), whose sum is σ = 81492039965280. Its totient is φ = 24447611989548.
The previous prime is 51611625311303. The next prime is 51611625311327. The reversal of 51611625311306 is 60311352611615.
51611625311306 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×516116253113062 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51611625311303) 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 3 ways as a sum of consecutive naturals, for example, 679100333006 + ... + 679100333081.
It is an arithmetic number, because the mean of its divisors is an integer number (10186504995660).
Almost surely, 251611625311306 is an apocalyptic number.
51611625311306 is a deficient number, since it is larger than the sum of its proper divisors (29880414653974).
51611625311306 is a wasteful number, since it uses less digits than its factorization.
51611625311306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358200666108.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 51611625311306 in words is "fifty-one trillion, six hundred eleven billion, six hundred twenty-five million, three hundred eleven thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •