Base | Representation |
---|---|
bin | 10000101000110… |
… | …10111100100101 |
3 | 100201121221101121 |
4 | 20110122330211 |
5 | 241212232411 |
6 | 21503253541 |
7 | 3313222324 |
oct | 1024327445 |
9 | 321557347 |
10 | 139570981 |
11 | 71869820 |
12 | 3a8aa2b1 |
13 | 22bb9ca4 |
14 | 147720bb |
15 | c3be571 |
hex | 851af25 |
139570981 has 8 divisors (see below), whose sum is σ = 152899200. Its totient is φ = 126349440.
The previous prime is 139570973. The next prime is 139571009. The reversal of 139570981 is 189075931.
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 139570981 - 23 = 139570973 is a prime.
It is a super-2 number, since 2×1395709812 = 38960117474604722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139579981) 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, 23916 + ... + 29173.
It is an arithmetic number, because the mean of its divisors is an integer number (19112400).
Almost surely, 2139570981 is an apocalyptic number.
139570981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
139570981 is a deficient number, since it is larger than the sum of its proper divisors (13328219).
139570981 is a wasteful number, since it uses less digits than its factorization.
139570981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53339.
The product of its (nonzero) digits is 68040, while the sum is 43.
The square root of 139570981 is about 11814.0162942160. The cubic root of 139570981 is about 518.7184677984.
The spelling of 139570981 in words is "one hundred thirty-nine million, five hundred seventy thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •