Base | Representation |
---|---|
bin | 10111101101110100011100… |
… | …00000101010110011000001 |
3 | 20211122200002212110020222120 |
4 | 23312322032000222303001 |
5 | 23313424020103314001 |
6 | 302530124004154453 |
7 | 13661564043061650 |
oct | 1366721600526301 |
9 | 224580085406876 |
10 | 52151875448001 |
11 | 1568753910394a |
12 | 5a23471698a29 |
13 | 2313b92c52034 |
14 | cc4242961197 |
15 | 6068cb1ca236 |
hex | 2f6e8e02acc1 |
52151875448001 has 64 divisors (see below), whose sum is σ = 81094064025600. Its totient is φ = 29195384564736.
The previous prime is 52151875447999. The next prime is 52151875448003. The reversal of 52151875448001 is 10084457815125.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (52151875447999) and next prime (52151875448003).
It is not a de Polignac number, because 52151875448001 - 21 = 52151875447999 is a prime.
It is a super-2 number, since 2×521518754480012 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (52151875448003) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1914589540 + ... + 1914616778.
It is an arithmetic number, because the mean of its divisors is an integer number (1267094750400).
Almost surely, 252151875448001 is an apocalyptic number.
It is an amenable number.
52151875448001 is a deficient number, since it is larger than the sum of its proper divisors (28942188577599).
52151875448001 is a wasteful number, since it uses less digits than its factorization.
52151875448001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32558.
The product of its (nonzero) digits is 1792000, while the sum is 51.
The spelling of 52151875448001 in words is "fifty-two trillion, one hundred fifty-one billion, eight hundred seventy-five million, four hundred forty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •