Base | Representation |
---|---|
bin | 1000001101101111100… |
… | …1110010011111111111 |
3 | 111111021110211002222022 |
4 | 2003123321302133333 |
5 | 4303012322002311 |
6 | 144500005310355 |
7 | 13124201603042 |
oct | 2033371623777 |
9 | 444243732868 |
10 | 141128312831 |
11 | 54941287290 |
12 | 234277053bb |
13 | 10401576a1c |
14 | 6b8b41ac59 |
15 | 3a0eceb5db |
hex | 20dbe727ff |
141128312831 has 8 divisors (see below), whose sum is σ = 154325606400. Its totient is φ = 127992260440.
The previous prime is 141128312821. The next prime is 141128312833. The reversal of 141128312831 is 138213821141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-141128312831 is a prime.
It is a super-2 number, since 2×1411283128312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141128312791 and 141128312800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141128312833) 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, 15305471 + ... + 15314688.
It is an arithmetic number, because the mean of its divisors is an integer number (19290700800).
Almost surely, 2141128312831 is an apocalyptic number.
141128312831 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
141128312831 is a deficient number, since it is larger than the sum of its proper divisors (13197293569).
141128312831 is a wasteful number, since it uses less digits than its factorization.
141128312831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30620589.
The product of its digits is 9216, while the sum is 35.
The spelling of 141128312831 in words is "one hundred forty-one billion, one hundred twenty-eight million, three hundred twelve thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •