Base | Representation |
---|---|
bin | 1000000011010011011… |
… | …0110111000110111010 |
3 | 111020001011022011210102 |
4 | 2000310312313012322 |
5 | 4231242343001302 |
6 | 143313532515402 |
7 | 12664561322363 |
oct | 2006466670672 |
9 | 436034264712 |
10 | 138325750202 |
11 | 53733309522 |
12 | 2298501bb62 |
13 | 10075a60243 |
14 | 69a312ab6a |
15 | 38e8c57702 |
hex | 2034db71ba |
138325750202 has 4 divisors (see below), whose sum is σ = 207488625306. Its totient is φ = 69162875100.
The previous prime is 138325750181. The next prime is 138325750207. The reversal of 138325750202 is 202057523831.
138325750202 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: 202057523831 = 487 ⋅414902513.
It can be written as a sum of positive squares in only one way, i.e., 115735359601 + 22590390601 = 340199^2 + 150301^2 .
It is a super-2 number, since 2×1383257502022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (138325750207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34581437549 + ... + 34581437552.
Almost surely, 2138325750202 is an apocalyptic number.
138325750202 is a deficient number, since it is larger than the sum of its proper divisors (69162875104).
138325750202 is an equidigital number, since it uses as much as digits as its factorization.
138325750202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69162875103.
The product of its (nonzero) digits is 100800, while the sum is 38.
The spelling of 138325750202 in words is "one hundred thirty-eight billion, three hundred twenty-five million, seven hundred fifty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •