Base | Representation |
---|---|
bin | 10000111000101… |
… | …00101100110110 |
3 | 100212112012001101 |
4 | 20130110230312 |
5 | 242230030200 |
6 | 22015520314 |
7 | 3336641020 |
oct | 1034245466 |
9 | 325465041 |
10 | 141642550 |
11 | 72a54165 |
12 | 3b52909a |
13 | 23463b7a |
14 | 14b51010 |
15 | c67d26a |
hex | 8714b36 |
141642550 has 24 divisors (see below), whose sum is σ = 301092336. Its totient is φ = 48563040.
The previous prime is 141642541. The next prime is 141642551. The reversal of 141642550 is 55246141.
It is a super-2 number, since 2×1416425502 = 40125223941005000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141642551) 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 11 ways as a sum of consecutive naturals, for example, 201997 + ... + 202696.
It is an arithmetic number, because the mean of its divisors is an integer number (12545514).
Almost surely, 2141642550 is an apocalyptic number.
141642550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141642550 is an abundant number, since it is smaller than the sum of its proper divisors (159449786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141642550 is a wasteful number, since it uses less digits than its factorization.
141642550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404712 (or 404707 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 141642550 is about 11901.3675684772. The cubic root of 141642550 is about 521.2722177289.
Adding to 141642550 its reverse (55246141), we get a palindrome (196888691).
The spelling of 141642550 in words is "one hundred forty-one million, six hundred forty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •