Base | Representation |
---|---|
bin | 100001000001111… |
… | …011000110010101 |
3 | 1102121201212002210 |
4 | 201001323012111 |
5 | 2113330333331 |
6 | 130553224033 |
7 | 16506134331 |
oct | 4101730625 |
9 | 1377655083 |
10 | 554152341 |
11 | 264893946 |
12 | 135702019 |
13 | 8aa654c2 |
14 | 538507c1 |
15 | 339b3446 |
hex | 2107b195 |
554152341 has 8 divisors (see below), whose sum is σ = 739270944. Its totient is φ = 369234320.
The previous prime is 554152297. The next prime is 554152343. The reversal of 554152341 is 143251455.
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 554152341 - 210 = 554151317 is a prime.
It is a super-3 number, since 3×5541523413 (a number of 27 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 554152299 and 554152308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554152343) 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 7 ways as a sum of consecutive naturals, for example, 43575 + ... + 54836.
It is an arithmetic number, because the mean of its divisors is an integer number (92408868).
Almost surely, 2554152341 is an apocalyptic number.
It is an amenable number.
554152341 is a deficient number, since it is larger than the sum of its proper divisors (185118603).
554152341 is a wasteful number, since it uses less digits than its factorization.
554152341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100291.
The product of its digits is 12000, while the sum is 30.
The square root of 554152341 is about 23540.4405438811. The cubic root of 554152341 is about 821.3779829686.
The spelling of 554152341 in words is "five hundred fifty-four million, one hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •