Base | Representation |
---|---|
bin | 1110001101110110110011… |
… | …1111110100100111010101 |
3 | 2001100022220020002110110021 |
4 | 3203131230333310213111 |
5 | 4022100211423110203 |
6 | 53124514134225141 |
7 | 3202214033240326 |
oct | 343355477644725 |
9 | 61308806073407 |
10 | 15631214660053 |
11 | 4a87185197193 |
12 | 19055261b51b1 |
13 | 89502ba9a225 |
14 | 3c07aa62c44d |
15 | 1c190ca905bd |
hex | e376cff49d5 |
15631214660053 has 4 divisors (see below), whose sum is σ = 15743669441920. Its totient is φ = 15518759878188.
The previous prime is 15631214660051. The next prime is 15631214660081. The reversal of 15631214660053 is 35006641213651.
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 not a de Polignac number, because 15631214660053 - 21 = 15631214660051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15631214659991 and 15631214660009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15631214660051) 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, 56227390725 + ... + 56227391002.
It is an arithmetic number, because the mean of its divisors is an integer number (3935917360480).
Almost surely, 215631214660053 is an apocalyptic number.
It is an amenable number.
15631214660053 is a deficient number, since it is larger than the sum of its proper divisors (112454781867).
15631214660053 is a wasteful number, since it uses less digits than its factorization.
15631214660053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112454781866.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 15631214660053 in words is "fifteen trillion, six hundred thirty-one billion, two hundred fourteen million, six hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •