Base | Representation |
---|---|
bin | 10111010101111100011011… |
… | …11110010000101101011001 |
3 | 20201202020200000011201111020 |
4 | 23222332031332100231121 |
5 | 23212003441213011241 |
6 | 301101214312153053 |
7 | 13545403213260213 |
oct | 1352761576205531 |
9 | 221666600151436 |
10 | 51331536063321 |
11 | 153a0644996428 |
12 | 591048b698789 |
13 | 228470a1c04c7 |
14 | c9666120b5b3 |
15 | 5e03b747db66 |
hex | 2eaf8df90b59 |
51331536063321 has 8 divisors (see below), whose sum is σ = 68449392477120. Its totient is φ = 34217351845872.
The previous prime is 51331536063299. The next prime is 51331536063337. The reversal of 51331536063321 is 12336063513315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51331536063321 - 219 = 51331535539033 is a prime.
It is a super-2 number, since 2×513315360633212 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51331536063121) 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, 918016470 + ... + 918072383.
It is an arithmetic number, because the mean of its divisors is an integer number (8556174059640).
Almost surely, 251331536063321 is an apocalyptic number.
It is an amenable number.
51331536063321 is a deficient number, since it is larger than the sum of its proper divisors (17117856413799).
51331536063321 is a wasteful number, since it uses less digits than its factorization.
51331536063321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1836098175.
The product of its (nonzero) digits is 437400, while the sum is 42.
Adding to 51331536063321 its reverse (12336063513315), we get a palindrome (63667599576636).
The spelling of 51331536063321 in words is "fifty-one trillion, three hundred thirty-one billion, five hundred thirty-six million, sixty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •