Base | Representation |
---|---|
bin | 10000100111000011010… |
… | …111101011111110111111 |
3 | 11001010021012110012001120 |
4 | 100213003113223332333 |
5 | 122200134142200111 |
6 | 2232212220242023 |
7 | 145316022523344 |
oct | 20470327537677 |
9 | 4033235405046 |
10 | 1141444100031 |
11 | 4000a1489834 |
12 | 1652773a0313 |
13 | 8383a0aa0a1 |
14 | 3d3637867cb |
15 | 1ea5913e406 |
hex | 109c35ebfbf |
1141444100031 has 8 divisors (see below), whose sum is σ = 1524457791024. Its totient is φ = 759696571200.
The previous prime is 1141444100009. The next prime is 1141444100057. The reversal of 1141444100031 is 1300014441411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1141444100031 - 219 = 1141443575743 is a prime.
It is a super-2 number, since 2×11414441000312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1141444099974 and 1141444100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141444100131) 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, 316538436 + ... + 316542041.
It is an arithmetic number, because the mean of its divisors is an integer number (190557223878).
Almost surely, 21141444100031 is an apocalyptic number.
1141444100031 is a deficient number, since it is larger than the sum of its proper divisors (383013690993).
1141444100031 is an equidigital number, since it uses as much as digits as its factorization.
1141444100031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633081081.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1141444100031 its reverse (1300014441411), we get a palindrome (2441458541442).
The spelling of 1141444100031 in words is "one trillion, one hundred forty-one billion, four hundred forty-four million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •