Base | Representation |
---|---|
bin | 10100001010011… |
… | …010000111000001 |
3 | 212120112000220201 |
4 | 110022122013001 |
5 | 1143044211310 |
6 | 53322205201 |
7 | 11245161541 |
oct | 2412320701 |
9 | 776460821 |
10 | 338272705 |
11 | 163a45321 |
12 | 95353801 |
13 | 5510b384 |
14 | 32cd7321 |
15 | 1ea6de3a |
hex | 1429a1c1 |
338272705 has 4 divisors (see below), whose sum is σ = 405927252. Its totient is φ = 270618160.
The previous prime is 338272687. The next prime is 338272709. The reversal of 338272705 is 507272833.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 189530289 + 148742416 = 13767^2 + 12196^2 .
It is a de Polignac number, because none of the positive numbers 2k-338272705 is a prime.
It is a super-2 number, since 2×3382727052 = 228856845896034050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (338272709) 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, 33827266 + ... + 33827275.
It is an arithmetic number, because the mean of its divisors is an integer number (101481813).
Almost surely, 2338272705 is an apocalyptic number.
It is an amenable number.
338272705 is a deficient number, since it is larger than the sum of its proper divisors (67654547).
338272705 is an equidigital number, since it uses as much as digits as its factorization.
338272705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67654546.
The product of its (nonzero) digits is 70560, while the sum is 37.
The square root of 338272705 is about 18392.1914137495. The cubic root of 338272705 is about 696.7692650749.
The spelling of 338272705 in words is "three hundred thirty-eight million, two hundred seventy-two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •