Base | Representation |
---|---|
bin | 1000001110011000111… |
… | …0001110001100011111 |
3 | 111111201112120221121020 |
4 | 2003212032032030133 |
5 | 4303341132110221 |
6 | 144525112135223 |
7 | 13131403301562 |
oct | 2034616161437 |
9 | 444645527536 |
10 | 141301441311 |
11 | 54a1aa86278 |
12 | 23475697513 |
13 | 1042b3b3004 |
14 | 6ba64064d9 |
15 | 3a200e8ac6 |
hex | 20e638e31f |
141301441311 has 8 divisors (see below), whose sum is σ = 188406392064. Its totient is φ = 94198725720.
The previous prime is 141301441277. The next prime is 141301441319. The reversal of 141301441311 is 113144103141.
141301441311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-141301441311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141301441319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 405255 + ... + 668456.
It is an arithmetic number, because the mean of its divisors is an integer number (23550799008).
Almost surely, 2141301441311 is an apocalyptic number.
141301441311 is a deficient number, since it is larger than the sum of its proper divisors (47104950753).
141301441311 is a wasteful number, since it uses less digits than its factorization.
141301441311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117581.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 141301441311 its reverse (113144103141), we get a palindrome (254445544452).
The spelling of 141301441311 in words is "one hundred forty-one billion, three hundred one million, four hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •