Base | Representation |
---|---|
bin | 10000000001001101111… |
… | …11101101101101111111 |
3 | 1221121201000121121022101 |
4 | 20000212333231231333 |
5 | 33004214433103211 |
6 | 1100504353325531 |
7 | 54523450143403 |
oct | 10004677555577 |
9 | 1847630547271 |
10 | 550410050431 |
11 | 1a24781404aa |
12 | 8a80b2668a7 |
13 | 3cb98b3a897 |
14 | 1c8d61b3103 |
15 | e4b64c45c1 |
hex | 8026fedb7f |
550410050431 has 8 divisors (see below), whose sum is σ = 551271302064. Its totient is φ = 549549409920.
The previous prime is 550410050389. The next prime is 550410050467. The reversal of 550410050431 is 134050014055.
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 550410050431 - 221 = 550407953279 is a prime.
It is a super-2 number, since 2×5504100504312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 550410050431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550410050231) 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, 1666836 + ... + 1969558.
It is an arithmetic number, because the mean of its divisors is an integer number (68908912758).
Almost surely, 2550410050431 is an apocalyptic number.
550410050431 is a deficient number, since it is larger than the sum of its proper divisors (861251633).
550410050431 is a wasteful number, since it uses less digits than its factorization.
550410050431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305561.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 550410050431 its reverse (134050014055), we get a palindrome (684460064486).
The spelling of 550410050431 in words is "five hundred fifty billion, four hundred ten million, fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •