Base | Representation |
---|---|
bin | 10111010101100111001110… |
… | …10101111000000001110101 |
3 | 20201201011021112021101202111 |
4 | 23222303213111320001311 |
5 | 23211312132013232041 |
6 | 301052052432411021 |
7 | 13544521112631121 |
oct | 1352634725700165 |
9 | 221634245241674 |
10 | 51320150524021 |
11 | 1539683206a215 |
12 | 590a2326a6a71 |
13 | 22836144485c2 |
14 | c95ca105c581 |
15 | 5dee4cb35981 |
hex | 2eace7578075 |
51320150524021 has 4 divisors (see below), whose sum is σ = 51627456814752. Its totient is φ = 51012844233292.
The previous prime is 51320150524007. The next prime is 51320150524033. The reversal of 51320150524021 is 12042505102315.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51320150524021 - 241 = 49121127268469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51320150524121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153653145115 + ... + 153653145448.
It is an arithmetic number, because the mean of its divisors is an integer number (12906864203688).
Almost surely, 251320150524021 is an apocalyptic number.
It is an amenable number.
51320150524021 is a deficient number, since it is larger than the sum of its proper divisors (307306290731).
51320150524021 is a wasteful number, since it uses less digits than its factorization.
51320150524021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307306290730.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 51320150524021 its reverse (12042505102315), we get a palindrome (63362655626336).
The spelling of 51320150524021 in words is "fifty-one trillion, three hundred twenty billion, one hundred fifty million, five hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •