Base | Representation |
---|---|
bin | 10000101000101… |
… | …01101101100110 |
3 | 100201120211222120 |
4 | 20110111231212 |
5 | 241211041132 |
6 | 21503010410 |
7 | 3313102656 |
oct | 1024255546 |
9 | 321524876 |
10 | 139549542 |
11 | 71854700 |
12 | 3a899a06 |
13 | 22bb02c2 |
14 | 14768366 |
15 | c3b802c |
hex | 8515b66 |
139549542 has 48 divisors (see below), whose sum is σ = 308883456. Its totient is φ = 41998000.
The previous prime is 139549541. The next prime is 139549561. The reversal of 139549542 is 245945931.
It is a junction number, because it is equal to n+sod(n) for n = 139549494 and 139549503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139549541) 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 23 ways as a sum of consecutive naturals, for example, 120667 + ... + 121817.
It is an arithmetic number, because the mean of its divisors is an integer number (6435072).
Almost surely, 2139549542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139549542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154441728).
139549542 is an abundant number, since it is smaller than the sum of its proper divisors (169333914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139549542 is a wasteful number, since it uses less digits than its factorization.
139549542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1345 (or 1334 counting only the distinct ones).
The product of its digits is 194400, while the sum is 42.
The square root of 139549542 is about 11813.1089049412. The cubic root of 139549542 is about 518.6919069412.
The spelling of 139549542 in words is "one hundred thirty-nine million, five hundred forty-nine thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •