Base | Representation |
---|---|
bin | 10000011111101… |
… | …00001010110011 |
3 | 100122100121010201 |
4 | 20033310022303 |
5 | 240410113241 |
6 | 21421340031 |
7 | 3300033223 |
oct | 1017641263 |
9 | 318317121 |
10 | 138363571 |
11 | 71114665 |
12 | 3a407617 |
13 | 22886548 |
14 | 1453a083 |
15 | c231931 |
hex | 83f42b3 |
138363571 has 4 divisors (see below), whose sum is σ = 142826944. Its totient is φ = 133900200.
The previous prime is 138363569. The next prime is 138363601. The reversal of 138363571 is 175363831.
It is a happy number.
138363571 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 175363831 = 37 ⋅4739563.
It is a cyclic number.
It is not a de Polignac number, because 138363571 - 21 = 138363569 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 138363571.
It is not an unprimeable number, because it can be changed into a prime (138363521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2231640 + ... + 2231701.
It is an arithmetic number, because the mean of its divisors is an integer number (35706736).
Almost surely, 2138363571 is an apocalyptic number.
138363571 is a deficient number, since it is larger than the sum of its proper divisors (4463373).
138363571 is an equidigital number, since it uses as much as digits as its factorization.
138363571 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4463372.
The product of its digits is 45360, while the sum is 37.
The square root of 138363571 is about 11762.8045550370. The cubic root of 138363571 is about 517.2183454938.
The spelling of 138363571 in words is "one hundred thirty-eight million, three hundred sixty-three thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •