Base | Representation |
---|---|
bin | 1000001101101100001… |
… | …1010001010101111001 |
3 | 111111020110221000121011 |
4 | 2003123003101111321 |
5 | 4303000142134431 |
6 | 144454335113521 |
7 | 13123636250434 |
oct | 2033303212571 |
9 | 444213830534 |
10 | 141114021241 |
11 | 54934205856 |
12 | 234229728a1 |
13 | 103cb61196b |
14 | 6b8957a81b |
15 | 3a0d926cb1 |
hex | 20db0d1579 |
141114021241 has 4 divisors (see below), whose sum is σ = 141273113472. Its totient is φ = 140954929012.
The previous prime is 141114021229. The next prime is 141114021253. The reversal of 141114021241 is 142120411141.
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 an interprime number because it is at equal distance from previous prime (141114021229) and next prime (141114021253).
It is a cyclic number.
It is not a de Polignac number, because 141114021241 - 225 = 141080466809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141114031241) 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, 79544785 + ... + 79546558.
It is an arithmetic number, because the mean of its divisors is an integer number (35318278368).
Almost surely, 2141114021241 is an apocalyptic number.
It is an amenable number.
141114021241 is a deficient number, since it is larger than the sum of its proper divisors (159092231).
141114021241 is an equidigital number, since it uses as much as digits as its factorization.
141114021241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159092230.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 141114021241 its reverse (142120411141), we get a palindrome (283234432382).
The spelling of 141114021241 in words is "one hundred forty-one billion, one hundred fourteen million, twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •