Base | Representation |
---|---|
bin | 10100010001000… |
… | …110001100010101 |
3 | 212200211010011111 |
4 | 110101012030111 |
5 | 1144021314013 |
6 | 53423535021 |
7 | 11266113556 |
oct | 2421061425 |
9 | 780733144 |
10 | 340026133 |
11 | 164a32737 |
12 | 95a5a471 |
13 | 555a34c5 |
14 | 3323232d |
15 | 1ecb873d |
hex | 14446315 |
340026133 has 8 divisors (see below), whose sum is σ = 341834240. Its totient is φ = 338223600.
The previous prime is 340026121. The next prime is 340026151. The reversal of 340026133 is 331620043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 340026133 - 25 = 340026101 is a prime.
It is a super-2 number, since 2×3400261332 = 231235542245867378, 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 (340026103) 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 7 ways as a sum of consecutive naturals, for example, 173308 + ... + 175258.
It is an arithmetic number, because the mean of its divisors is an integer number (42729280).
Almost surely, 2340026133 is an apocalyptic number.
It is an amenable number.
340026133 is a deficient number, since it is larger than the sum of its proper divisors (1808107).
340026133 is a wasteful number, since it uses less digits than its factorization.
340026133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2787.
The product of its (nonzero) digits is 1296, while the sum is 22.
The square root of 340026133 is about 18439.7975314264. The cubic root of 340026133 is about 697.9710862044.
Adding to 340026133 its reverse (331620043), we get a palindrome (671646176).
The spelling of 340026133 in words is "three hundred forty million, twenty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •