Base | Representation |
---|---|
bin | 1001001110100… |
… | …0110010000101 |
3 | 2200211021110022 |
4 | 2103220302011 |
5 | 34401432323 |
6 | 3501304525 |
7 | 646651304 |
oct | 223506205 |
9 | 80737408 |
10 | 38702213 |
11 | 1a934600 |
12 | 10b65145 |
13 | 8030c24 |
14 | 51d643b |
15 | 35e74c8 |
hex | 24e8c85 |
38702213 has 12 divisors (see below), whose sum is σ = 42716940. Its totient is φ = 35038080.
The previous prime is 38702207. The next prime is 38702233. The reversal of 38702213 is 31220783.
It can be written as a sum of positive squares in 2 ways, for example, as 6235009 + 32467204 = 2497^2 + 5698^2 .
It is not a de Polignac number, because 38702213 - 210 = 38701189 is a prime.
It is a super-2 number, since 2×387022132 = 2995722582194738, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38702203) 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 11 ways as a sum of consecutive naturals, for example, 37853 + ... + 38861.
It is an arithmetic number, because the mean of its divisors is an integer number (3559745).
Almost surely, 238702213 is an apocalyptic number.
It is an amenable number.
38702213 is a deficient number, since it is larger than the sum of its proper divisors (4014727).
38702213 is a wasteful number, since it uses less digits than its factorization.
38702213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1348 (or 1337 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 38702213 is about 6221.1102706832. The cubic root of 38702213 is about 338.2558110355.
Adding to 38702213 its reverse (31220783), we get a palindrome (69922996).
The spelling of 38702213 in words is "thirty-eight million, seven hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •