Base | Representation |
---|---|
bin | 1000000100100111101… |
… | …1000010111000100111 |
3 | 111020221210022200121220 |
4 | 2001021323002320213 |
5 | 4233003331343201 |
6 | 143412555511423 |
7 | 13006412324520 |
oct | 2011173027047 |
9 | 436853280556 |
10 | 138679168551 |
11 | 538a4858a00 |
12 | 22a63458573 |
13 | 10101042321 |
14 | 69d8047847 |
15 | 3919cb9036 |
hex | 2049ec2e27 |
138679168551 has 48 divisors (see below), whose sum is σ = 232655942400. Its totient is φ = 71923927680.
The previous prime is 138679168519. The next prime is 138679168553. The reversal of 138679168551 is 155861976831.
It is a happy number.
It is not a de Polignac number, because 138679168551 - 25 = 138679168519 is a prime.
It is a hoax number, since the sum of its digits (60) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138679168553) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 1528795 + ... + 1616963.
It is an arithmetic number, because the mean of its divisors is an integer number (4846998800).
Almost surely, 2138679168551 is an apocalyptic number.
138679168551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
138679168551 is a deficient number, since it is larger than the sum of its proper divisors (93976773849).
138679168551 is a wasteful number, since it uses less digits than its factorization.
138679168551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88820 (or 88809 counting only the distinct ones).
The product of its digits is 10886400, while the sum is 60.
The spelling of 138679168551 in words is "one hundred thirty-eight billion, six hundred seventy-nine million, one hundred sixty-eight thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •