Base | Representation |
---|---|
bin | 10000101011011… |
… | …11000000011101 |
3 | 100202021102200220 |
4 | 20111233000131 |
5 | 241304242133 |
6 | 21514511553 |
7 | 3316155210 |
oct | 1025570035 |
9 | 322242626 |
10 | 139915293 |
11 | 71a84481 |
12 | 3aa355b9 |
13 | 22caa91b |
14 | 14821777 |
15 | c43b5b3 |
hex | 856f01d |
139915293 has 8 divisors (see below), whose sum is σ = 213204288. Its totient is φ = 79951584.
The previous prime is 139915291. The next prime is 139915301. The reversal of 139915293 is 392519931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 139915293 - 21 = 139915291 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139915291) 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 7 ways as a sum of consecutive naturals, for example, 3331296 + ... + 3331337.
It is an arithmetic number, because the mean of its divisors is an integer number (26650536).
Almost surely, 2139915293 is an apocalyptic number.
It is an amenable number.
139915293 is a deficient number, since it is larger than the sum of its proper divisors (73288995).
139915293 is an equidigital number, since it uses as much as digits as its factorization.
139915293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6662643.
The product of its digits is 65610, while the sum is 42.
The square root of 139915293 is about 11828.5795005148. The cubic root of 139915293 is about 519.1446651051.
The spelling of 139915293 in words is "one hundred thirty-nine million, nine hundred fifteen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •