Base | Representation |
---|---|
bin | 10000100110011… |
… | …01010011000111 |
3 | 100201000210010010 |
4 | 20103031103013 |
5 | 241122043220 |
6 | 21452401303 |
7 | 3310426143 |
oct | 1023152307 |
9 | 321023103 |
10 | 139252935 |
11 | 71671878 |
12 | 3a776233 |
13 | 22b082b3 |
14 | 146cc223 |
15 | c35a1e0 |
hex | 84cd4c7 |
139252935 has 16 divisors (see below), whose sum is σ = 226458720. Its totient is φ = 73050240.
The previous prime is 139252931. The next prime is 139252969. The reversal of 139252935 is 539252931.
It is a happy number.
It is not a de Polignac number, because 139252935 - 22 = 139252931 is a prime.
It is a super-2 number, since 2×1392529352 = 38782759812228450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139252893 and 139252902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139252931) 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 15 ways as a sum of consecutive naturals, for example, 75180 + ... + 77009.
It is an arithmetic number, because the mean of its divisors is an integer number (14153670).
Almost surely, 2139252935 is an apocalyptic number.
139252935 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
139252935 is a deficient number, since it is larger than the sum of its proper divisors (87205785).
139252935 is a wasteful number, since it uses less digits than its factorization.
139252935 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152258.
The product of its digits is 72900, while the sum is 39.
The square root of 139252935 is about 11800.5480804919. The cubic root of 139252935 is about 518.3241599362.
The spelling of 139252935 in words is "one hundred thirty-nine million, two hundred fifty-two thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •