Base | Representation |
---|---|
bin | 100101100011101000100… |
… | …0001100001100101001011 |
3 | 200021110102002220121122101 |
4 | 1023013101001201211023 |
5 | 1134032242203412311 |
6 | 14551140405334231 |
7 | 1041632200560166 |
oct | 113072101414513 |
9 | 20243362817571 |
10 | 5161762560331 |
11 | 1710100442353 |
12 | 6b4473a07377 |
13 | 2b59a15428a0 |
14 | 13bb8b3c8add |
15 | 8e408cbdec1 |
hex | 4b1d106194b |
5161762560331 has 8 divisors (see below), whose sum is σ = 5562652266864. Its totient is φ = 4761420146400.
The previous prime is 5161762560323. The next prime is 5161762560343. The reversal of 5161762560331 is 1330652671615.
5161762560331 is digitally balanced in base 3, 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 cyclic number.
It is not a de Polignac number, because 5161762560331 - 23 = 5161762560323 is a prime.
It is a super-2 number, since 2×51617625603312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5161762560431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136803556 + ... + 136841281.
It is an arithmetic number, because the mean of its divisors is an integer number (695331533358).
Almost surely, 25161762560331 is an apocalyptic number.
5161762560331 is a deficient number, since it is larger than the sum of its proper divisors (400889706533).
5161762560331 is a wasteful number, since it uses less digits than its factorization.
5161762560331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273646301.
The product of its (nonzero) digits is 680400, while the sum is 46.
The spelling of 5161762560331 in words is "five trillion, one hundred sixty-one billion, seven hundred sixty-two million, five hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •