Search a number
-
+
138061507 = 314639619
BaseRepresentation
bin10000011101010…
…10011011000011
3100121210020210011
420032222123003
5240320432012
621411045351
73264334453
oct1016523303
9317706704
10138061507
1170a28721
123a2a0857
13227abbcc
141449bd63
15c1c21a7
hex83aa6c3

138061507 has 8 divisors (see below), whose sum is σ = 142837760. Its totient is φ = 133305480.

The previous prime is 138061501. The next prime is 138061523. The reversal of 138061507 is 705160831.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 138061507 - 23 = 138061499 is a prime.

It is a super-2 number, since 2×1380615072 = 38121959430222098, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (31).

It is a Duffinian number.

It is a plaindrome in base 13.

It is not an unprimeable number, because it can be changed into a prime (138061501) by changing a digit.

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 7 ways as a sum of consecutive naturals, for example, 9544 + ... + 19162.

It is an arithmetic number, because the mean of its divisors is an integer number (17854720).

Almost surely, 2138061507 is an apocalyptic number.

138061507 is a deficient number, since it is larger than the sum of its proper divisors (4776253).

138061507 is an equidigital number, since it uses as much as digits as its factorization.

138061507 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 10113.

The product of its (nonzero) digits is 5040, while the sum is 31.

The square root of 138061507 is about 11749.9577446049. The cubic root of 138061507 is about 516.8416883747.

The spelling of 138061507 in words is "one hundred thirty-eight million, sixty-one thousand, five hundred seven".

Divisors: 1 31 463 9619 14353 298189 4453597 138061507