Base | Representation |
---|---|
bin | 1000001101010010101… |
… | …1111000100011101001 |
3 | 111110222000222022121002 |
4 | 2003110223320203221 |
5 | 4302240322231423 |
6 | 144440002124345 |
7 | 13121201440334 |
oct | 2032453704351 |
9 | 443860868532 |
10 | 141007227113 |
11 | 548899a3845 |
12 | 233b30506b5 |
13 | 103b245c87c |
14 | 6b792db61b |
15 | 3a0437e228 |
hex | 20d4af88e9 |
141007227113 has 4 divisors (see below), whose sum is σ = 141008708820. Its totient is φ = 141005745408.
The previous prime is 141007227091. The next prime is 141007227131. The reversal of 141007227113 is 311722700141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311722700141 = 107 ⋅2913296263.
It can be written as a sum of positive squares in 2 ways, for example, as 40915984729 + 100091242384 = 202277^2 + 316372^2 .
It is a cyclic number.
It is not a de Polignac number, because 141007227113 - 212 = 141007223017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141007227013) 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, 587528 + ... + 791961.
It is an arithmetic number, because the mean of its divisors is an integer number (35252177205).
Almost surely, 2141007227113 is an apocalyptic number.
It is an amenable number.
141007227113 is a deficient number, since it is larger than the sum of its proper divisors (1481707).
141007227113 is a wasteful number, since it uses less digits than its factorization.
141007227113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1481706.
The product of its (nonzero) digits is 2352, while the sum is 29.
Adding to 141007227113 its reverse (311722700141), we get a palindrome (452729927254).
The spelling of 141007227113 in words is "one hundred forty-one billion, seven million, two hundred twenty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •