Base | Representation |
---|---|
bin | 10000101000110… |
… | …10011100111101 |
3 | 100201121211121122 |
4 | 20110122130331 |
5 | 241212201312 |
6 | 21503240325 |
7 | 3313213403 |
oct | 1024323475 |
9 | 321554548 |
10 | 139568957 |
11 | 71868250 |
12 | 3a8a90a5 |
13 | 22bb90a8 |
14 | 14771473 |
15 | c3bdb72 |
hex | 851a73d |
139568957 has 4 divisors (see below), whose sum is σ = 152257056. Its totient is φ = 126880860.
The previous prime is 139568953. The next prime is 139568969. The reversal of 139568957 is 759865931.
139568957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 139568957 - 22 = 139568953 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139568899 and 139568908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139568953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6344033 + ... + 6344054.
It is an arithmetic number, because the mean of its divisors is an integer number (38064264).
Almost surely, 2139568957 is an apocalyptic number.
It is an amenable number.
139568957 is a deficient number, since it is larger than the sum of its proper divisors (12688099).
139568957 is a wasteful number, since it uses less digits than its factorization.
139568957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12688098.
The product of its digits is 2041200, while the sum is 53.
The square root of 139568957 is about 11813.9306329435. The cubic root of 139568957 is about 518.7159603735.
The spelling of 139568957 in words is "one hundred thirty-nine million, five hundred sixty-eight thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •