Base | Representation |
---|---|
bin | 10111010101111010101000… |
… | …00011110110111010110101 |
3 | 20201202011011021220202100112 |
4 | 23222331110003312322311 |
5 | 23211444443444431041 |
6 | 301100534043152405 |
7 | 13545340144564211 |
oct | 1352752403667265 |
9 | 221664137822315 |
10 | 51330564452021 |
11 | 153a01964a2488 |
12 | 591025a215705 |
13 | 22845b3b12a8a |
14 | c965ac16d941 |
15 | 5e035c008deb |
hex | 2eaf540f6eb5 |
51330564452021 has 8 divisors (see below), whose sum is σ = 53765987172480. Its totient is φ = 48912113318992.
The previous prime is 51330564451979. The next prime is 51330564452099. The reversal of 51330564452021 is 12025446503315.
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 51330564452021 - 214 = 51330564435637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51330564452021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51330564454021) 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, 4242890666 + ... + 4242902763.
It is an arithmetic number, because the mean of its divisors is an integer number (6720748396560).
Almost surely, 251330564452021 is an apocalyptic number.
It is an amenable number.
51330564452021 is a deficient number, since it is larger than the sum of its proper divisors (2435422720459).
51330564452021 is a wasteful number, since it uses less digits than its factorization.
51330564452021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8485793715.
The product of its (nonzero) digits is 432000, while the sum is 41.
The spelling of 51330564452021 in words is "fifty-one trillion, three hundred thirty billion, five hundred sixty-four million, four hundred fifty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •