Base | Representation |
---|---|
bin | 111011001111000110000101… |
… | …1001011110000000110011101 |
3 | 2112022212100000100100020221211 |
4 | 1312132030023023300012131 |
5 | 1021243241402124103341 |
6 | 5044100213102024421 |
7 | 214515124434330106 |
oct | 16636141313600635 |
9 | 2468770010306854 |
10 | 521044145144221 |
11 | 141025643382a66 |
12 | 4a531a19b78111 |
13 | 19497337a05b6a |
14 | 9294957a253ad |
15 | 4038849878181 |
hex | 1d9e30b2f019d |
521044145144221 has 8 divisors (see below), whose sum is σ = 523442372785920. Its totient is φ = 518646819950208.
The previous prime is 521044145144191. The next prime is 521044145144231. The reversal of 521044145144221 is 122441541440125.
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 521044145144221 - 27 = 521044145144093 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 (521044145144231) 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, 224454516 + ... + 226764013.
It is an arithmetic number, because the mean of its divisors is an integer number (65430296598240).
Almost surely, 2521044145144221 is an apocalyptic number.
It is an amenable number.
521044145144221 is a deficient number, since it is larger than the sum of its proper divisors (2398227641699).
521044145144221 is a wasteful number, since it uses less digits than its factorization.
521044145144221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451223843.
The product of its (nonzero) digits is 204800, while the sum is 40.
Adding to 521044145144221 its reverse (122441541440125), we get a palindrome (643485686584346).
The spelling of 521044145144221 in words is "five hundred twenty-one trillion, forty-four billion, one hundred forty-five million, one hundred forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •