Base | Representation |
---|---|
bin | 111110101001011100100001… |
… | …0001000111100111100111101 |
3 | 2200021010020200222120020002211 |
4 | 1331102321002020330330331 |
5 | 1034211432044413420321 |
6 | 5231554414155220421 |
7 | 224033223626004556 |
oct | 17522710210747475 |
9 | 2607106628506084 |
10 | 551054003654461 |
11 | 14a64576612973a |
12 | 51979b5aa47711 |
13 | 1a863228723108 |
14 | 9a1122842332d |
15 | 43a92a4db20e1 |
hex | 1f52e4223cf3d |
551054003654461 has 8 divisors (see below), whose sum is σ = 575013419495424. Its totient is φ = 527094633323280.
The previous prime is 551054003654431. The next prime is 551054003654489. The reversal of 551054003654461 is 164456300450155.
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 551054003654461 - 211 = 551054003652413 is a prime.
It is a super-2 number, since 2×5510540036544612 (a number of 30 digits) 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 (551054003654431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14630980 + ... + 36279106.
It is an arithmetic number, because the mean of its divisors is an integer number (71876677436928).
Almost surely, 2551054003654461 is an apocalyptic number.
It is an amenable number.
551054003654461 is a deficient number, since it is larger than the sum of its proper divisors (23959415840963).
551054003654461 is a wasteful number, since it uses less digits than its factorization.
551054003654461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22754891.
The product of its (nonzero) digits is 4320000, while the sum is 49.
The spelling of 551054003654461 in words is "five hundred fifty-one trillion, fifty-four billion, three million, six hundred fifty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •