Base | Representation |
---|---|
bin | 100000000110111011111010… |
… | …110001100001000001011010 |
3 | 200111222221101100200211102110 |
4 | 200012323322301201001122 |
5 | 122002123030330322302 |
6 | 1220200514204413150 |
7 | 41513246040254625 |
oct | 4006737261410132 |
9 | 614887340624373 |
10 | 141214142042202 |
11 | 40aa4643812a19 |
12 | 13a082b65471b6 |
13 | 60a4589b7acc8 |
14 | 26c2b2db04dbc |
15 | 114d485a16b6c |
hex | 806efac6105a |
141214142042202 has 8 divisors (see below), whose sum is σ = 282428284084416. Its totient is φ = 47071380680732.
The previous prime is 141214142042179. The next prime is 141214142042213. The reversal of 141214142042202 is 202240241412141.
It is a sphenic number, since it is the product of 3 distinct primes.
141214142042202 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 141214142042202.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11767845170178 + ... + 11767845170189.
It is an arithmetic number, because the mean of its divisors is an integer number (35303535510552).
Almost surely, 2141214142042202 is an apocalyptic number.
141214142042202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141214142042202 is a wasteful number, since it uses less digits than its factorization.
141214142042202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23535690340372.
The product of its (nonzero) digits is 8192, while the sum is 30.
Adding to 141214142042202 its reverse (202240241412141), we get a palindrome (343454383454343).
The spelling of 141214142042202 in words is "one hundred forty-one trillion, two hundred fourteen billion, one hundred forty-two million, forty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •