Base | Representation |
---|---|
bin | 10000011110111… |
… | …01101101010111 |
3 | 100122011220221110 |
4 | 20033131231113 |
5 | 240344142300 |
6 | 21415350103 |
7 | 3266201061 |
oct | 1017355527 |
9 | 318156843 |
10 | 138271575 |
11 | 71061532 |
12 | 3a382333 |
13 | 22853700 |
14 | 14514731 |
15 | c214550 |
hex | 83ddb57 |
138271575 has 36 divisors (see below), whose sum is σ = 247569720. Its totient is φ = 68065920.
The previous prime is 138271571. The next prime is 138271579. The reversal of 138271575 is 575172831.
It is an interprime number because it is at equal distance from previous prime (138271571) and next prime (138271579).
It is not a de Polignac number, because 138271575 - 22 = 138271571 is a prime.
It is a super-3 number, since 3×1382715753 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138271571) 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 35 ways as a sum of consecutive naturals, for example, 7221 + ... + 18129.
Almost surely, 2138271575 is an apocalyptic number.
138271575 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
138271575 is a deficient number, since it is larger than the sum of its proper divisors (109298145).
138271575 is a wasteful number, since it uses less digits than its factorization.
138271575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10948 (or 10930 counting only the distinct ones).
The product of its digits is 58800, while the sum is 39.
The square root of 138271575 is about 11758.8934428372. The cubic root of 138271575 is about 517.1036896683.
The spelling of 138271575 in words is "one hundred thirty-eight million, two hundred seventy-one thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •