Base | Representation |
---|---|
bin | 1000001001111101100… |
… | …1011100011111110101 |
3 | 111101122201201002112001 |
4 | 2002133121130133311 |
5 | 4243422434414031 |
6 | 144211144055301 |
7 | 13060064362534 |
oct | 2023731343765 |
9 | 441581632461 |
10 | 140113201141 |
11 | 54470281901 |
12 | 231a3764531 |
13 | 1029c178414 |
14 | 6ad269831b |
15 | 39a0b32861 |
hex | 209f65c7f5 |
140113201141 has 4 divisors (see below), whose sum is σ = 140119412800. Its totient is φ = 140106989484.
The previous prime is 140113201037. The next prime is 140113201147. The reversal of 140113201141 is 141102311041.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141102311041 = 151 ⋅934452391.
It is a cyclic number.
It is not a de Polignac number, because 140113201141 - 29 = 140113200629 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 (140113201147) 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, 3071871 + ... + 3117148.
It is an arithmetic number, because the mean of its divisors is an integer number (35029853200).
Almost surely, 2140113201141 is an apocalyptic number.
It is an amenable number.
140113201141 is a deficient number, since it is larger than the sum of its proper divisors (6211659).
140113201141 is an equidigital number, since it uses as much as digits as its factorization.
140113201141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6211658.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 140113201141 its reverse (141102311041), we get a palindrome (281215512182).
The spelling of 140113201141 in words is "one hundred forty billion, one hundred thirteen million, two hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •