Base | Representation |
---|---|
bin | 101001000001100111111… |
… | …1000111100010011001111 |
3 | 201222000220201002211012121 |
4 | 1102003033320330103033 |
5 | 1214340104113344434 |
6 | 15554141215513411 |
7 | 1121236624614655 |
oct | 122031770742317 |
9 | 21860821084177 |
10 | 5638484903119 |
11 | 18842a4807412 |
12 | 770939228867 |
13 | 31b925c272a3 |
14 | 156c92cc4dd5 |
15 | 9ba0b0487b4 |
hex | 520cfe3c4cf |
5638484903119 has 4 divisors (see below), whose sum is σ = 5639188753960. Its totient is φ = 5637781052280.
The previous prime is 5638484903083. The next prime is 5638484903131. The reversal of 5638484903119 is 9113094848365.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5638484903119 is a prime.
It is a super-2 number, since 2×56384849031192 (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 (5638484903179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 351913404 + ... + 351929425.
It is an arithmetic number, because the mean of its divisors is an integer number (1409797188490).
Almost surely, 25638484903119 is an apocalyptic number.
5638484903119 is a deficient number, since it is larger than the sum of its proper divisors (703850841).
5638484903119 is an equidigital number, since it uses as much as digits as its factorization.
5638484903119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703850840.
The product of its (nonzero) digits is 22394880, while the sum is 61.
The spelling of 5638484903119 in words is "five trillion, six hundred thirty-eight billion, four hundred eighty-four million, nine hundred three thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •