Base | Representation |
---|---|
bin | 1000000111011000111… |
… | …1000110111110010010 |
3 | 111022212121021020002012 |
4 | 2001312033012332102 |
5 | 4241014143010212 |
6 | 144014434422522 |
7 | 13034010523154 |
oct | 2016617067622 |
9 | 438777236065 |
10 | 139422625682 |
11 | 5414648a28a |
12 | 23030431a42 |
13 | 101bc0889a2 |
14 | 6a68a94ad4 |
15 | 39601c2922 |
hex | 20763c6f92 |
139422625682 has 6 divisors (see below), whose sum is σ = 209134730613. Its totient is φ = 69711048812.
The previous prime is 139422625669. The next prime is 139422625711. The reversal of 139422625682 is 286526224931.
139422625682 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 97019167441 + 42403458241 = 311479^2 + 205921^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=264029.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139422625682.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 396044 + ... + 660072.
Almost surely, 2139422625682 is an apocalyptic number.
139422625682 is a deficient number, since it is larger than the sum of its proper divisors (69712104931).
139422625682 is an frugal number, since it uses more digits than its factorization.
139422625682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528060 (or 264031 counting only the distinct ones).
The product of its digits is 2488320, while the sum is 50.
Multiplying 139422625682 by its sum of digits (50), we get a square (6971131284100 = 26402902).
The spelling of 139422625682 in words is "one hundred thirty-nine billion, four hundred twenty-two million, six hundred twenty-five thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •