Base | Representation |
---|---|
bin | 10000100110001… |
… | …11100111001101 |
3 | 100200222121011112 |
4 | 20103013213031 |
5 | 241120322040 |
6 | 21452101405 |
7 | 3310301222 |
oct | 1023074715 |
9 | 320877145 |
10 | 139229645 |
11 | 71656325 |
12 | 3a764865 |
13 | 22aca809 |
14 | 146c3949 |
15 | c353365 |
hex | 84c79cd |
139229645 has 8 divisors (see below), whose sum is σ = 171150840. Its totient is φ = 108666880.
The previous prime is 139229639. The next prime is 139229653. The reversal of 139229645 is 546922931.
139229645 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1261129 + 137968516 = 1123^2 + 11746^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 139229645 - 26 = 139229581 is a prime.
It is a super-3 number, since 3×1392296453 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339380 + ... + 339789.
It is an arithmetic number, because the mean of its divisors is an integer number (21393855).
Almost surely, 2139229645 is an apocalyptic number.
It is an amenable number.
139229645 is a deficient number, since it is larger than the sum of its proper divisors (31921195).
139229645 is an equidigital number, since it uses as much as digits as its factorization.
139229645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679215.
The product of its digits is 116640, while the sum is 41.
The square root of 139229645 is about 11799.5612206556. The cubic root of 139229645 is about 518.2952618194.
The spelling of 139229645 in words is "one hundred thirty-nine million, two hundred twenty-nine thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •