Base | Representation |
---|---|
bin | 10111001100010110110100… |
… | …000111101000001011000101 |
3 | 111101011111200002121012202101 |
4 | 113030112310013220023011 |
5 | 101332214100223224031 |
6 | 1000540025504512101 |
7 | 30325363112640664 |
oct | 2714266407501305 |
9 | 441144602535671 |
10 | 102004200211141 |
11 | 2a557813858838 |
12 | b53512031b631 |
13 | 44bbc5492b147 |
14 | 1b2905b450ddb |
15 | bbd56b3be361 |
hex | 5cc5b41e82c5 |
102004200211141 has 8 divisors (see below), whose sum is σ = 102748199083200. Its totient is φ = 101262515488992.
The previous prime is 102004200211127. The next prime is 102004200211157. The reversal of 102004200211141 is 141112002400201.
It is a happy number.
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 102004200211141 - 219 = 102004199686853 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 (102004200212141) 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, 578449000 + ... + 578625313.
It is an arithmetic number, because the mean of its divisors is an integer number (12843524885400).
Almost surely, 2102004200211141 is an apocalyptic number.
It is an amenable number.
102004200211141 is a deficient number, since it is larger than the sum of its proper divisors (743998872059).
102004200211141 is a wasteful number, since it uses less digits than its factorization.
102004200211141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1157074955.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102004200211141 its reverse (141112002400201), we get a palindrome (243116202611342).
The spelling of 102004200211141 in words is "one hundred two trillion, four billion, two hundred million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •