Base | Representation |
---|---|
bin | 100000000110101110101111… |
… | …111110110010110110111001 |
3 | 200111221120212221100000210110 |
4 | 200012232233332302312321 |
5 | 122001410101044030131 |
6 | 1220150215141334533 |
7 | 41512235454555204 |
oct | 4006565776626671 |
9 | 614846787300713 |
10 | 141200002330041 |
11 | 40a99648269996 |
12 | 13a0560b107449 |
13 | 60a3145632b15 |
14 | 26c218bc6093b |
15 | 114ce094d7646 |
hex | 806baffb2db9 |
141200002330041 has 4 divisors (see below), whose sum is σ = 188266669773392. Its totient is φ = 94133334886692.
The previous prime is 141200002330039. The next prime is 141200002330061. The reversal of 141200002330041 is 140033200002141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 141200002330041 - 21 = 141200002330039 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (141200002330061) 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, 23533333721671 + ... + 23533333721676.
It is an arithmetic number, because the mean of its divisors is an integer number (47066667443348).
Almost surely, 2141200002330041 is an apocalyptic number.
It is an amenable number.
141200002330041 is a deficient number, since it is larger than the sum of its proper divisors (47066667443351).
141200002330041 is an equidigital number, since it uses as much as digits as its factorization.
141200002330041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47066667443350.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 141200002330041 its reverse (140033200002141), we get a palindrome (281233202332182).
The spelling of 141200002330041 in words is "one hundred forty-one trillion, two hundred billion, two million, three hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •