Base | Representation |
---|---|
bin | 101000000001001100111… |
… | …1011101010010010001101 |
3 | 201110210211021001202122112 |
4 | 1100002121323222102031 |
5 | 1210103242004130441 |
6 | 15410421343153405 |
7 | 1105241420335211 |
oct | 120023173522215 |
9 | 21423737052575 |
10 | 5500140692621 |
11 | 183066203a453 |
12 | 749b69ba5865 |
13 | 30b8794026c3 |
14 | 1502cb550941 |
15 | 981108964eb |
hex | 50099eea48d |
5500140692621 has 4 divisors (see below), whose sum is σ = 5500225137792. Its totient is φ = 5500056247452.
The previous prime is 5500140692611. The next prime is 5500140692687. The reversal of 5500140692621 is 1262960410055.
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-5500140692621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500140692611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42124811 + ... + 42255176.
It is an arithmetic number, because the mean of its divisors is an integer number (1375056284448).
Almost surely, 25500140692621 is an apocalyptic number.
It is an amenable number.
5500140692621 is a deficient number, since it is larger than the sum of its proper divisors (84445171).
5500140692621 is an equidigital number, since it uses as much as digits as its factorization.
5500140692621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84445170.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 5500140692621 in words is "five trillion, five hundred billion, one hundred forty million, six hundred ninety-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •