Base | Representation |
---|---|
bin | 10111011110001010111100… |
… | …01101100110100100000100 |
3 | 20202202021021112011121022011 |
4 | 23233011132031212210010 |
5 | 23231121341332321124 |
6 | 301435123133344004 |
7 | 13605001025333062 |
oct | 1357053615464404 |
9 | 222667245147264 |
10 | 51614202620164 |
11 | 1549a507888298 |
12 | 5957218038004 |
13 | 22a5276c1b972 |
14 | ca61d8273032 |
15 | 5e790d04c994 |
hex | 2ef15e366904 |
51614202620164 has 24 divisors (see below), whose sum is σ = 96985096564608. Its totient is φ = 23946937418880.
The previous prime is 51614202620161. The next prime is 51614202620191. The reversal of 51614202620164 is 46102620241615.
51614202620164 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (51614202620161) 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 7 ways as a sum of consecutive naturals, for example, 5345293704 + ... + 5345303359.
It is an arithmetic number, because the mean of its divisors is an integer number (4041045690192).
Almost surely, 251614202620164 is an apocalyptic number.
It is an amenable number.
51614202620164 is a deficient number, since it is larger than the sum of its proper divisors (45370893944444).
51614202620164 is a wasteful number, since it uses less digits than its factorization.
51614202620164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10690597155 (or 10690597153 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 40.
Adding to 51614202620164 its reverse (46102620241615), we get a palindrome (97716822861779).
The spelling of 51614202620164 in words is "fifty-one trillion, six hundred fourteen billion, two hundred two million, six hundred twenty thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •