Base | Representation |
---|---|
bin | 101000011000100010010… |
… | …1101100110110111001101 |
3 | 201122121011111121102002012 |
4 | 1100301010231212313031 |
5 | 1211413403120142111 |
6 | 15445425551311005 |
7 | 1111664245201034 |
oct | 120610455466715 |
9 | 21577144542065 |
10 | 5550250552781 |
11 | 184a936819020 |
12 | 75781381b465 |
13 | 313503b58c2c |
14 | 1528c26bb71b |
15 | 99594bdc48b |
hex | 50c44b66dcd |
5550250552781 has 4 divisors (see below), whose sum is σ = 6054818784864. Its totient is φ = 5045682320700.
The previous prime is 5550250552723. The next prime is 5550250552811. The reversal of 5550250552781 is 1872550520555.
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 a de Polignac number, because none of the positive numbers 2k-5550250552781 is a prime.
It is a super-2 number, since 2×55502505527812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5550250552981) 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, 252284116025 + ... + 252284116046.
It is an arithmetic number, because the mean of its divisors is an integer number (1513704696216).
Almost surely, 25550250552781 is an apocalyptic number.
It is an amenable number.
5550250552781 is a deficient number, since it is larger than the sum of its proper divisors (504568232083).
5550250552781 is a wasteful number, since it uses less digits than its factorization.
5550250552781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504568232082.
The product of its (nonzero) digits is 3500000, while the sum is 50.
The spelling of 5550250552781 in words is "five trillion, five hundred fifty billion, two hundred fifty million, five hundred fifty-two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •