Base | Representation |
---|---|
bin | 10111011111100010010011… |
… | …10100001100010100100011 |
3 | 20202220202100020101011100201 |
4 | 23233301021310030110203 |
5 | 23232403420343230021 |
6 | 301512441203330031 |
7 | 13611251225421454 |
oct | 1357611164142443 |
9 | 222822306334321 |
10 | 51661105055011 |
11 | 15508396001841 |
12 | 5964327680917 |
13 | 22a98100069aa |
14 | ca85a744112b |
15 | 5e8c559ca591 |
hex | 2efc49d0c523 |
51661105055011 has 4 divisors (see below), whose sum is σ = 51663592010992. Its totient is φ = 51658618099032.
The previous prime is 51661105054969. The next prime is 51661105055117. The reversal of 51661105055011 is 11055050116615.
51661105055011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51661105055011 - 29 = 51661105054499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51661105035011) 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, 1243446831 + ... + 1243488376.
It is an arithmetic number, because the mean of its divisors is an integer number (12915898002748).
Almost surely, 251661105055011 is an apocalyptic number.
51661105055011 is a deficient number, since it is larger than the sum of its proper divisors (2486955981).
51661105055011 is a wasteful number, since it uses less digits than its factorization.
51661105055011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2486955980.
The product of its (nonzero) digits is 22500, while the sum is 37.
The spelling of 51661105055011 in words is "fifty-one trillion, six hundred sixty-one billion, one hundred five million, fifty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •