Base | Representation |
---|---|
bin | 111110100011010011100010… |
… | …1100111110110011001010111 |
3 | 2200011010120102221212011200101 |
4 | 1331012213011213312121113 |
5 | 1034104120241324341210 |
6 | 5230111010404554531 |
7 | 223615240135623541 |
oct | 17506470547663127 |
9 | 2604116387764611 |
10 | 550210101012055 |
11 | 14a34a880089a00 |
12 | 518624a16b2a47 |
13 | 1a801788ccc633 |
14 | 99c244d480691 |
15 | 4392362694a3a |
hex | 1f469c59f6657 |
550210101012055 has 24 divisors (see below), whose sum is σ = 726001160756256. Its totient is φ = 400004209577280.
The previous prime is 550210101011951. The next prime is 550210101012071.
550210101012055 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 550210101012055 - 223 = 550210092623447 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 167222979 + ... + 170481508.
It is an arithmetic number, because the mean of its divisors is an integer number (30250048364844).
Almost surely, 2550210101012055 is an apocalyptic number.
550210101012055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
550210101012055 is a deficient number, since it is larger than the sum of its proper divisors (175791059744201).
550210101012055 is a wasteful number, since it uses less digits than its factorization.
550210101012055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337707207 (or 337707196 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 28.
It can be divided in two parts, 55021010 and 1012055, that added together give a palindrome (56033065).
The spelling of 550210101012055 in words is "five hundred fifty trillion, two hundred ten billion, one hundred one million, twelve thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •