Base | Representation |
---|---|
bin | 1000000110001111101… |
… | …1011110100011001101 |
3 | 111022002012100002102111 |
4 | 2001203323132203031 |
5 | 4234402031130420 |
6 | 143524143424021 |
7 | 13023261102310 |
oct | 2014373364315 |
9 | 438065302374 |
10 | 139115489485 |
11 | 53aa9081315 |
12 | 22b655b5011 |
13 | 1017055c9ab |
14 | 6a39d84977 |
15 | 394325445a |
hex | 2063ede8cd |
139115489485 has 64 divisors (see below), whose sum is σ = 199558692864. Its totient is φ = 91097395200.
The previous prime is 139115489483. The next prime is 139115489573. The reversal of 139115489485 is 584984511931.
It is not a de Polignac number, because 139115489485 - 21 = 139115489483 is a prime.
It is a super-2 number, since 2×1391154894852 (a number of 23 digits) 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 (139115489483) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26591820 + ... + 26597050.
It is an arithmetic number, because the mean of its divisors is an integer number (3118104576).
Almost surely, 2139115489485 is an apocalyptic number.
It is an amenable number.
139115489485 is a deficient number, since it is larger than the sum of its proper divisors (60443203379).
139115489485 is a wasteful number, since it uses less digits than its factorization.
139115489485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5594.
The product of its digits is 6220800, while the sum is 58.
The spelling of 139115489485 in words is "one hundred thirty-nine billion, one hundred fifteen million, four hundred eighty-nine thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •