Base | Representation |
---|---|
bin | 111110101001011101101111… |
… | …1101011001011100100101011 |
3 | 2200021010111112011211022121020 |
4 | 1331102323133223023210223 |
5 | 1034212003003020301110 |
6 | 5231555532331543523 |
7 | 224033346261051432 |
oct | 17522733753134453 |
9 | 2607114464738536 |
10 | 551056646650155 |
11 | 14a6468a20204a8 |
12 | 5197a577bbaba3 |
13 | 1a86355a16b2a9 |
14 | 9a113d9458119 |
15 | 43a93abe36d70 |
hex | 1f52edfacb92b |
551056646650155 has 32 divisors (see below), whose sum is σ = 896235104716608. Its totient is φ = 289049694912000.
The previous prime is 551056646650123. The next prime is 551056646650163.
551056646650155 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 551056646650155 - 25 = 551056646650123 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21354064 + ... + 39472893.
It is an arithmetic number, because the mean of its divisors is an integer number (28007347022394).
Almost surely, 2551056646650155 is an apocalyptic number.
551056646650155 is a deficient number, since it is larger than the sum of its proper divisors (345178458066453).
551056646650155 is a wasteful number, since it uses less digits than its factorization.
551056646650155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60836927.
The product of its (nonzero) digits is 81000000, while the sum is 60.
Adding to 551056646650155 its product of nonzero digits (81000000), we get a palindrome (551056727650155).
Subtracting from 551056646650155 its product of nonzero digits (81000000), we obtain a palindrome (551056565650155).
The spelling of 551056646650155 in words is "five hundred fifty-one trillion, fifty-six billion, six hundred forty-six million, six hundred fifty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •