Base | Representation |
---|---|
bin | 1000001001001011011… |
… | …0001001000110000100 |
3 | 111101010001110110112212 |
4 | 2002102312021012010 |
5 | 4243010032320121 |
6 | 144134222402552 |
7 | 13051626435464 |
oct | 2022266110604 |
9 | 441101413485 |
10 | 139902620036 |
11 | 54372422133 |
12 | 23145130458 |
13 | 10267657c0a |
14 | 6ab271dba4 |
15 | 398c3d825b |
hex | 2092d89184 |
139902620036 has 12 divisors (see below), whose sum is σ = 244967374428. Its totient is φ = 69911941632.
The previous prime is 139902620003. The next prime is 139902620059. The reversal of 139902620036 is 630026209931.
It can be written as a sum of positive squares in 2 ways, for example, as 48400000000 + 91502620036 = 220000^2 + 302494^2 .
It is a junction number, because it is equal to n+sod(n) for n = 139902619975 and 139902620002.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 9834101 + ... + 9848316.
It is an arithmetic number, because the mean of its divisors is an integer number (20413947869).
Almost surely, 2139902620036 is an apocalyptic number.
It is an amenable number.
139902620036 is a deficient number, since it is larger than the sum of its proper divisors (105064754392).
139902620036 is a wasteful number, since it uses less digits than its factorization.
139902620036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19684198 (or 19684196 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 41.
Adding to 139902620036 its reverse (630026209931), we get a palindrome (769928829967).
The spelling of 139902620036 in words is "one hundred thirty-nine billion, nine hundred two million, six hundred twenty thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •