Base | Representation |
---|---|
bin | 1001000100101… |
… | …0110011000011 |
3 | 2122121101210102 |
4 | 2101022303003 |
5 | 34220230412 |
6 | 3435353015 |
7 | 641314556 |
oct | 221126303 |
9 | 78541712 |
10 | 38055107 |
11 | 1a532402 |
12 | 108b276b |
13 | 7b6551c |
14 | 50a869d |
15 | 351a8c2 |
hex | 244acc3 |
38055107 has 4 divisors (see below), whose sum is σ = 38345736. Its totient is φ = 37764480.
The previous prime is 38055103. The next prime is 38055109. The reversal of 38055107 is 70155083.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70155083 = 23 ⋅3050221.
It is a cyclic number.
It is not a de Polignac number, because 38055107 - 22 = 38055103 is a prime.
It is a super-3 number, since 3×380551073 (a number of 24 digits) contains 333 as substring.
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 38055107.
It is not an unprimeable number, because it can be changed into a prime (38055103) 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, 145118 + ... + 145379.
It is an arithmetic number, because the mean of its divisors is an integer number (9586434).
Almost surely, 238055107 is an apocalyptic number.
38055107 is a deficient number, since it is larger than the sum of its proper divisors (290629).
38055107 is a wasteful number, since it uses less digits than its factorization.
38055107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290628.
The product of its (nonzero) digits is 4200, while the sum is 29.
The square root of 38055107 is about 6168.8821515733. The cubic root of 38055107 is about 336.3599783054.
The spelling of 38055107 in words is "thirty-eight million, fifty-five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •