Base | Representation |
---|---|
bin | 10000110110010… |
… | …00111001001110 |
3 | 100211221102010020 |
4 | 20123020321032 |
5 | 242140111141 |
6 | 22005123010 |
7 | 3334205532 |
oct | 1033107116 |
9 | 324842106 |
10 | 141332046 |
11 | 72861949 |
12 | 3b3b9466 |
13 | 2338573b |
14 | 14aadbc2 |
15 | c61b266 |
hex | 86c8e4e |
141332046 has 8 divisors (see below), whose sum is σ = 282664104. Its totient is φ = 47110680.
The previous prime is 141332039. The next prime is 141332047. The reversal of 141332046 is 640233141.
It is a sphenic number, since it is the product of 3 distinct primes.
141332046 is an admirable number.
It is a super-2 number, since 2×1413320462 = 39949494453092232, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141332047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11777665 + ... + 11777676.
It is an arithmetic number, because the mean of its divisors is an integer number (35333013).
Almost surely, 2141332046 is an apocalyptic number.
141332046 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141332046 is a wasteful number, since it uses less digits than its factorization.
141332046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23555346.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 141332046 is about 11888.3155240766. The cubic root of 141332046 is about 520.8910339544.
Adding to 141332046 its reverse (640233141), we get a palindrome (781565187).
The spelling of 141332046 in words is "one hundred forty-one million, three hundred thirty-two thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •