Base | Representation |
---|---|
bin | 10000100101010… |
… | …11001010101011 |
3 | 100200202200100012 |
4 | 20102223022223 |
5 | 241103110011 |
6 | 21445402135 |
7 | 3306304433 |
oct | 1022531253 |
9 | 320680305 |
10 | 139113131 |
11 | 71586833 |
12 | 3a70934b |
13 | 22a89781 |
14 | 146932c3 |
15 | c32da8b |
hex | 84ab2ab |
139113131 has 8 divisors (see below), whose sum is σ = 145926144. Its totient is φ = 132363880.
The previous prime is 139113113. The next prime is 139113157. The reversal of 139113131 is 131311931.
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 139113131 - 26 = 139113067 is a prime.
It is a super-2 number, since 2×1391131312 = 38704926433246322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139113097 and 139113106.
It is not an unprimeable number, because it can be changed into a prime (139113101) 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, 11441 + ... + 20226.
It is an arithmetic number, because the mean of its divisors is an integer number (18240768).
Almost surely, 2139113131 is an apocalyptic number.
139113131 is a deficient number, since it is larger than the sum of its proper divisors (6813013).
139113131 is a wasteful number, since it uses less digits than its factorization.
139113131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31881.
The product of its digits is 243, while the sum is 23.
The square root of 139113131 is about 11794.6229698113. The cubic root of 139113131 is about 518.1506434149.
The spelling of 139113131 in words is "one hundred thirty-nine million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •