Base | Representation |
---|---|
bin | 110000011110011111… |
… | …000100110111010101 |
3 | 11222100112021100022000 |
4 | 300132133010313111 |
5 | 1323100033223141 |
6 | 35524551025513 |
7 | 3521605540620 |
oct | 603637046725 |
9 | 158315240260 |
10 | 52051070421 |
11 | 20090521679 |
12 | a10796b299 |
13 | 4ba698876c |
14 | 273acc0db7 |
15 | 15499945b6 |
hex | c1e7c4dd5 |
52051070421 has 16 divisors (see below), whose sum is σ = 88128796800. Its totient is φ = 29743468704.
The previous prime is 52051070417. The next prime is 52051070429. The reversal of 52051070421 is 12407015025.
52051070421 is a `hidden beast` number, since 520 + 51 + 0 + 70 + 4 + 21 = 666.
It is not a de Polignac number, because 52051070421 - 22 = 52051070417 is a prime.
It is a super-2 number, since 2×520510704212 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52051070429) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137701056 + ... + 137701433.
It is an arithmetic number, because the mean of its divisors is an integer number (5508049800).
Almost surely, 252051070421 is an apocalyptic number.
It is an amenable number.
52051070421 is a deficient number, since it is larger than the sum of its proper divisors (36077726379).
52051070421 is a wasteful number, since it uses less digits than its factorization.
52051070421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275402505 (or 275402499 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
Adding to 52051070421 its reverse (12407015025), we get a palindrome (64458085446).
The spelling of 52051070421 in words is "fifty-two billion, fifty-one million, seventy thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •