Base | Representation |
---|---|
bin | 10000100100111… |
… | …01100111100001 |
3 | 100200122212012201 |
4 | 20102131213201 |
5 | 241044321013 |
6 | 21444253201 |
7 | 3305653561 |
oct | 1022354741 |
9 | 320585181 |
10 | 139057633 |
11 | 71549070 |
12 | 3a6a1201 |
13 | 22a6a430 |
14 | 1467ada1 |
15 | c31c3dd |
hex | 849d9e1 |
139057633 has 8 divisors (see below), whose sum is σ = 163368576. Its totient is φ = 116691600.
The previous prime is 139057591. The next prime is 139057649. The reversal of 139057633 is 336750931.
It is a happy number.
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 139057633 - 217 = 138926561 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139057592 and 139057601.
It is not an unprimeable number, because it can be changed into a prime (139057693) 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, 486073 + ... + 486358.
It is an arithmetic number, because the mean of its divisors is an integer number (20421072).
Almost surely, 2139057633 is an apocalyptic number.
139057633 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
139057633 is a deficient number, since it is larger than the sum of its proper divisors (24310943).
139057633 is a wasteful number, since it uses less digits than its factorization.
139057633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972455.
The product of its (nonzero) digits is 51030, while the sum is 37.
The square root of 139057633 is about 11792.2700528779. The cubic root of 139057633 is about 518.0817303198.
The spelling of 139057633 in words is "one hundred thirty-nine million, fifty-seven thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •