Base | Representation |
---|---|
bin | 1000001010000100100… |
… | …1010001001111011001 |
3 | 111101201202212101210111 |
4 | 2002201021101033121 |
5 | 4244002440441121 |
6 | 144214112244321 |
7 | 13060601503255 |
oct | 2024111211731 |
9 | 441652771714 |
10 | 140142515161 |
11 | 54485883970 |
12 | 231b15406a1 |
13 | 102a52700ac |
14 | 6ad6529265 |
15 | 39a34c32e1 |
hex | 20a12513d9 |
140142515161 has 8 divisors (see below), whose sum is σ = 152901928800. Its totient is φ = 127386299040.
The previous prime is 140142515143. The next prime is 140142515203. The reversal of 140142515161 is 161515241041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140142515161 - 221 = 140140418009 is a prime.
It is a super-2 number, since 2×1401425151612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140142515561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 707271 + ... + 883468.
It is an arithmetic number, because the mean of its divisors is an integer number (19112741100).
Almost surely, 2140142515161 is an apocalyptic number.
140142515161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140142515161 is a deficient number, since it is larger than the sum of its proper divisors (12759413639).
140142515161 is a wasteful number, since it uses less digits than its factorization.
140142515161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1598759.
The product of its (nonzero) digits is 4800, while the sum is 31.
The spelling of 140142515161 in words is "one hundred forty billion, one hundred forty-two million, five hundred fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •