Base | Representation |
---|---|
bin | 1000000010101011001… |
… | …0001111001011100101 |
3 | 111012121101022212221111 |
4 | 2000222302033023211 |
5 | 4230421113002200 |
6 | 143245054545021 |
7 | 12660440064013 |
oct | 2005262171345 |
9 | 435541285844 |
10 | 138156765925 |
11 | 536569900a2 |
12 | 22938508171 |
13 | 10049a45349 |
14 | 69888dd8b3 |
15 | 38d8ec80ba |
hex | 202ac8f2e5 |
138156765925 has 6 divisors (see below), whose sum is σ = 171314389778. Its totient is φ = 110525412720.
The previous prime is 138156765899. The next prime is 138156765937. The reversal of 138156765925 is 529567651831.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 14252061924 + 123904704001 = 119382^2 + 352001^2 .
It is not a de Polignac number, because 138156765925 - 229 = 137619895013 is a prime.
It is a super-2 number, since 2×1381567659252 (a number of 23 digits) contains 22 as substring.
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 138156765925.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2763135294 + ... + 2763135343.
Almost surely, 2138156765925 is an apocalyptic number.
It is an amenable number.
138156765925 is a deficient number, since it is larger than the sum of its proper divisors (33157623853).
138156765925 is an equidigital number, since it uses as much as digits as its factorization.
138156765925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5526270647 (or 5526270642 counting only the distinct ones).
The product of its digits is 13608000, while the sum is 58.
The spelling of 138156765925 in words is "one hundred thirty-eight billion, one hundred fifty-six million, seven hundred sixty-five thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •