Base | Representation |
---|---|
bin | 10000000001001100111… |
… | …10001011101111110110 |
3 | 1221121200102002000211122 |
4 | 20000212132023233312 |
5 | 33004210210314114 |
6 | 1100503441103542 |
7 | 54523312344026 |
oct | 10004636135766 |
9 | 1847612060748 |
10 | 550401260534 |
11 | 1a2473187524 |
12 | 8a808327bb2 |
13 | 3cb97080a68 |
14 | 1c8d4d65a86 |
15 | e4b5839e8e |
hex | 802678bbf6 |
550401260534 has 4 divisors (see below), whose sum is σ = 825601890804. Its totient is φ = 275200630266.
The previous prime is 550401260489. The next prime is 550401260537. The reversal of 550401260534 is 435062104055.
550401260534 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×5504012605342 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 550401260494 and 550401260503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550401260537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 137600315132 + ... + 137600315135.
It is an arithmetic number, because the mean of its divisors is an integer number (206400472701).
Almost surely, 2550401260534 is an apocalyptic number.
550401260534 is a deficient number, since it is larger than the sum of its proper divisors (275200630270).
550401260534 is a wasteful number, since it uses less digits than its factorization.
550401260534 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275200630269.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 550401260534 its reverse (435062104055), we get a palindrome (985463364589).
The spelling of 550401260534 in words is "five hundred fifty billion, four hundred one million, two hundred sixty thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •