Base | Representation |
---|---|
bin | 10000100100100… |
… | …11001110000101 |
3 | 100200120200210101 |
4 | 20102103032011 |
5 | 241041440140 |
6 | 21443324101 |
7 | 3305415451 |
oct | 1022231605 |
9 | 320520711 |
10 | 139015045 |
11 | 7151a074 |
12 | 3a680631 |
13 | 22a53c30 |
14 | 14669661 |
15 | c30e99a |
hex | 8493385 |
139015045 has 8 divisors (see below), whose sum is σ = 179650296. Its totient is φ = 102657216.
The previous prime is 139015043. The next prime is 139015061. The reversal of 139015045 is 540510931.
It can be written as a sum of positive squares in 4 ways, for example, as 1046529 + 137968516 = 1023^2 + 11746^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 139015045 - 21 = 139015043 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139015043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1069282 + ... + 1069411.
It is an arithmetic number, because the mean of its divisors is an integer number (22456287).
Almost surely, 2139015045 is an apocalyptic number.
It is an amenable number.
139015045 is a deficient number, since it is larger than the sum of its proper divisors (40635251).
139015045 is a wasteful number, since it uses less digits than its factorization.
139015045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2138711.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 139015045 is about 11790.4641554097. The cubic root of 139015045 is about 518.0288354227.
Adding to 139015045 its reverse (540510931), we get a palindrome (679525976).
The spelling of 139015045 in words is "one hundred thirty-nine million, fifteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •