Base | Representation |
---|---|
bin | 10000100001100… |
… | …00100101101011 |
3 | 100122211011121122 |
4 | 20100300211223 |
5 | 240441023201 |
6 | 21430525455 |
7 | 3302113565 |
oct | 1020604553 |
9 | 318734548 |
10 | 138611051 |
11 | 71273597 |
12 | 3a50688b |
13 | 22942097 |
14 | 145a2335 |
15 | c27ee1b |
hex | 843096b |
138611051 has 4 divisors (see below), whose sum is σ = 138634704. Its totient is φ = 138587400.
The previous prime is 138611029. The next prime is 138611063. The reversal of 138611051 is 150116831.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 138611051 - 26 = 138610987 is a prime.
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 138611051.
It is not an unprimeable number, because it can be changed into a prime (138611021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4241 + ... + 17181.
It is an arithmetic number, because the mean of its divisors is an integer number (34658676).
Almost surely, 2138611051 is an apocalyptic number.
138611051 is a deficient number, since it is larger than the sum of its proper divisors (23653).
138611051 is a wasteful number, since it uses less digits than its factorization.
138611051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23652.
The product of its (nonzero) digits is 720, while the sum is 26.
The square root of 138611051 is about 11773.3194554467. The cubic root of 138611051 is about 517.5265310365.
Adding to 138611051 its reverse (150116831), we get a palindrome (288727882).
The spelling of 138611051 in words is "one hundred thirty-eight million, six hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •