Base | Representation |
---|---|
bin | 100111101010011101000… |
… | …000111000100000000001 |
3 | 100122120100210011001000001 |
4 | 213222131000320200001 |
5 | 324124104220120001 |
6 | 5444050544000001 |
7 | 400630662440413 |
oct | 47523500704001 |
9 | 10576323131001 |
10 | 2725643520001 |
11 | 960a36789616 |
12 | 3802b8600001 |
13 | 16a04766018c |
14 | 95cc97b29b3 |
15 | 4ad784c0001 |
hex | 27a9d038801 |
2725643520001 has 4 divisors (see below), whose sum is σ = 2725785640404. Its totient is φ = 2725501399600.
The previous prime is 2725643519969. The next prime is 2725643520029. The reversal of 2725643520001 is 1000253465272.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2283317434225 + 442326085776 = 1511065^2 + 665076^2 .
It is a cyclic number.
It is not a de Polignac number, because 2725643520001 - 25 = 2725643519969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2725643520601) 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, 71031430 + ... + 71069791.
It is an arithmetic number, because the mean of its divisors is an integer number (681446410101).
Almost surely, 22725643520001 is an apocalyptic number.
It is an amenable number.
2725643520001 is a deficient number, since it is larger than the sum of its proper divisors (142120403).
2725643520001 is a wasteful number, since it uses less digits than its factorization.
2725643520001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142120402.
The product of its (nonzero) digits is 100800, while the sum is 37.
Adding to 2725643520001 its reverse (1000253465272), we get a palindrome (3725896985273).
The spelling of 2725643520001 in words is "two trillion, seven hundred twenty-five billion, six hundred forty-three million, five hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •