Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …110000011111000110100101 |
3 | 200101110020112212211021120202 |
4 | 133320113220300133012211 |
5 | 121334222423233333331 |
6 | 1214113003053240245 |
7 | 41351030430566246 |
oct | 3770275060370645 |
9 | 611406485737522 |
10 | 140213112402341 |
11 | 4074905766a3a0 |
12 | 138862a7793085 |
13 | 6031069498214 |
14 | 268a4caa36ccd |
15 | 11323e8bb6ecb |
hex | 7f85e8c1f1a5 |
140213112402341 has 16 divisors (see below), whose sum is σ = 153272461475328. Its totient is φ = 127205944786800.
The previous prime is 140213112402329. The next prime is 140213112402371. The reversal of 140213112402341 is 143204211312041.
It is not a de Polignac number, because 140213112402341 - 210 = 140213112401317 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 (140213112402371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42065690 + ... + 45276356.
It is an arithmetic number, because the mean of its divisors is an integer number (9579528842208).
Almost surely, 2140213112402341 is an apocalyptic number.
140213112402341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140213112402341 is a deficient number, since it is larger than the sum of its proper divisors (13059349072987).
140213112402341 is a wasteful number, since it uses less digits than its factorization.
140213112402341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3218792.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 140213112402341 its reverse (143204211312041), we get a palindrome (283417323714382).
The spelling of 140213112402341 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred twelve million, four hundred two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •