Base | Representation |
---|---|
bin | 100001000001100… |
… | …010111000011001 |
3 | 1102121112211000212 |
4 | 201001202320121 |
5 | 2113314200040 |
6 | 130551140505 |
7 | 16505242202 |
oct | 4101427031 |
9 | 1377484025 |
10 | 554053145 |
11 | 264826368 |
12 | 135674735 |
13 | 8aa2c2c9 |
14 | 538265a9 |
15 | 33993d65 |
hex | 21062e19 |
554053145 has 8 divisors (see below), whose sum is σ = 665227080. Its totient is φ = 443000320.
The previous prime is 554053099. The next prime is 554053147. The reversal of 554053145 is 541350455.
It can be written as a sum of positive squares in 4 ways, for example, as 2226064 + 551827081 = 1492^2 + 23491^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-554053145 is a prime.
It is not an unprimeable number, because it can be changed into a prime (554053147) 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, 19886 + ... + 38775.
It is an arithmetic number, because the mean of its divisors is an integer number (83153385).
Almost surely, 2554053145 is an apocalyptic number.
It is an amenable number.
554053145 is a deficient number, since it is larger than the sum of its proper divisors (111173935).
554053145 is a wasteful number, since it uses less digits than its factorization.
554053145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60555.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 554053145 is about 23538.3335221506. Note that the first 3 decimals coincide. The cubic root of 554053145 is about 821.3289698083.
It can be divided in two parts, 5540 and 53145, that added together give a palindrome (58685).
The spelling of 554053145 in words is "five hundred fifty-four million, fifty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •