Base | Representation |
---|---|
bin | 101111111010010100100110… |
… | …101111001100010110110001 |
3 | 1000122002020221011020012101212 |
4 | 233322110212233030112301 |
5 | 210104332422321232031 |
6 | 2024053340153405505 |
7 | 62245505626041656 |
oct | 5772244657142661 |
9 | 1018066834205355 |
10 | 210716040414641 |
11 | 61160197504993 |
12 | 1b77221b709895 |
13 | 907658bb1aa38 |
14 | 3a069d4509c2d |
15 | 195631b3b512b |
hex | bfa526bcc5b1 |
210716040414641 has 8 divisors (see below), whose sum is σ = 212888675394024. Its totient is φ = 208543411653120.
The previous prime is 210716040414619. The next prime is 210716040414647. The reversal of 210716040414641 is 146414040617012.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 26719295003041 + 183996745411600 = 5169071^2 + 13564540^2 .
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 210716040414641 - 26 = 210716040414577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210716040414647) 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, 101851451 + ... + 103899711.
It is an arithmetic number, because the mean of its divisors is an integer number (26611084424253).
Almost surely, 2210716040414641 is an apocalyptic number.
It is an amenable number.
210716040414641 is a deficient number, since it is larger than the sum of its proper divisors (2172634979383).
210716040414641 is a wasteful number, since it uses less digits than its factorization.
210716040414641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3108931.
The product of its (nonzero) digits is 129024, while the sum is 41.
The spelling of 210716040414641 in words is "two hundred ten trillion, seven hundred sixteen billion, forty million, four hundred fourteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •