Base | Representation |
---|---|
bin | 10000100110001… |
… | …10101011000001 |
3 | 100200222101212212 |
4 | 20103012223001 |
5 | 241120211133 |
6 | 21452031505 |
7 | 3310254050 |
oct | 1023065301 |
9 | 320871785 |
10 | 139225793 |
11 | 71653443 |
12 | 3a762595 |
13 | 22ac8b35 |
14 | 146c2397 |
15 | c352148 |
hex | 84c6ac1 |
139225793 has 4 divisors (see below), whose sum is σ = 159115200. Its totient is φ = 119336388.
The previous prime is 139225763. The next prime is 139225811. The reversal of 139225793 is 397522931.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139225793 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139225793.
It is not an unprimeable number, because it can be changed into a prime (139225763) 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 3 ways as a sum of consecutive naturals, for example, 9944693 + ... + 9944706.
It is an arithmetic number, because the mean of its divisors is an integer number (39778800).
Almost surely, 2139225793 is an apocalyptic number.
It is an amenable number.
139225793 is a deficient number, since it is larger than the sum of its proper divisors (19889407).
139225793 is an equidigital number, since it uses as much as digits as its factorization.
139225793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19889406.
The product of its digits is 102060, while the sum is 41.
The square root of 139225793 is about 11799.3979931181. The cubic root of 139225793 is about 518.2904819662.
The spelling of 139225793 in words is "one hundred thirty-nine million, two hundred twenty-five thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •