Base | Representation |
---|---|
bin | 10101000110011… |
… | …010001010011100 |
3 | 220200010010212001 |
4 | 111012122022130 |
5 | 1211111022224 |
6 | 55043252044 |
7 | 11525651350 |
oct | 2506321234 |
9 | 820103761 |
10 | 354001564 |
11 | 171908684 |
12 | 9a67a024 |
13 | 584576a7 |
14 | 3502d460 |
15 | 21129544 |
hex | 1519a29c |
354001564 has 12 divisors (see below), whose sum is σ = 708003184. Its totient is φ = 151714944.
The previous prime is 354001553. The next prime is 354001567. The reversal of 354001564 is 465100453.
354001564 is an admirable number.
It is a super-3 number, since 3×3540015643 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 12642913 = 354001564 / (3 + 5 + 4 + 0 + 0 + 1 + 5 + 6 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (354001567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6321429 + ... + 6321484.
Almost surely, 2354001564 is an apocalyptic number.
It is an amenable number.
354001564 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
354001564 is a wasteful number, since it uses less digits than its factorization.
354001564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12642924 (or 12642922 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 354001564 is about 18814.9292850119. The cubic root of 354001564 is about 707.4054372985.
The spelling of 354001564 in words is "three hundred fifty-four million, one thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •