Base | Representation |
---|---|
bin | 1000000011000001101… |
… | …0010011100010011000 |
3 | 111012211221221101020200 |
4 | 2000300122103202120 |
5 | 4231114243434413 |
6 | 143302310022200 |
7 | 12662664301416 |
oct | 2006032234230 |
9 | 435757841220 |
10 | 138251155608 |
11 | 536a519a4a5 |
12 | 22964047960 |
13 | 10063473327 |
14 | 69972702b6 |
15 | 38e2420573 |
hex | 2030693898 |
138251155608 has 48 divisors (see below), whose sum is σ = 375473264400. Its totient is φ = 45955343040.
The previous prime is 138251155591. The next prime is 138251155643. The reversal of 138251155608 is 806551152831.
138251155608 is a `hidden beast` number, since 1 + 3 + 8 + 25 + 1 + 15 + 5 + 608 = 666.
It is a super-2 number, since 2×1382511556082 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 2648463 + ... + 2700158.
It is an arithmetic number, because the mean of its divisors is an integer number (7822359675).
Almost surely, 2138251155608 is an apocalyptic number.
138251155608 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
138251155608 is an abundant number, since it is smaller than the sum of its proper divisors (237222108792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138251155608 is a wasteful number, since it uses less digits than its factorization.
138251155608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5348992 (or 5348985 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 45.
The spelling of 138251155608 in words is "one hundred thirty-eight billion, two hundred fifty-one million, one hundred fifty-five thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •