Base | Representation |
---|---|
bin | 10000000000111010010… |
… | …00001100011110011001 |
3 | 1221121021111002211201211 |
4 | 20000131020030132121 |
5 | 33003400043021101 |
6 | 1100440121143121 |
7 | 54516400043230 |
oct | 10003510143631 |
9 | 1847244084654 |
10 | 550244501401 |
11 | 1a23a2749021 |
12 | 8a78392aaa1 |
13 | 3cb7075648a |
14 | 1c8bc1dbb17 |
15 | e4a6bc2c51 |
hex | 801d20c799 |
550244501401 has 4 divisors (see below), whose sum is σ = 628850858752. Its totient is φ = 471638144052.
The previous prime is 550244501383. The next prime is 550244501431. The reversal of 550244501401 is 104105442055.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 550244501401 - 27 = 550244501273 is a prime.
It is a super-2 number, since 2×5502445014012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550244501431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39303178665 + ... + 39303178678.
It is an arithmetic number, because the mean of its divisors is an integer number (157212714688).
Almost surely, 2550244501401 is an apocalyptic number.
It is an amenable number.
550244501401 is a deficient number, since it is larger than the sum of its proper divisors (78606357351).
550244501401 is an equidigital number, since it uses as much as digits as its factorization.
550244501401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78606357350.
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 550244501401 its reverse (104105442055), we get a palindrome (654349943456).
The spelling of 550244501401 in words is "five hundred fifty billion, two hundred forty-four million, five hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •