Base | Representation |
---|---|
bin | 1001100100101111010101… |
… | …01000111011011000100011 |
3 | 2202112200221120202201021021 |
4 | 10302113222220323120203 |
5 | 10224420203224041420 |
6 | 112435513243510311 |
7 | 4302033060315304 |
oct | 462275250733043 |
9 | 82480846681237 |
10 | 21053571315235 |
11 | 6787851161a78 |
12 | 24403a6528397 |
13 | b99460197c74 |
14 | 52add94387ab |
15 | 2679b97897aa |
hex | 1325eaa3b623 |
21053571315235 has 8 divisors (see below), whose sum is σ = 25496068015440. Its totient is φ = 16688335427424.
The previous prime is 21053571315221. The next prime is 21053571315239. The reversal of 21053571315235 is 53251317535012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21053571315235 - 225 = 21053537760803 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21053571315191 and 21053571315200.
It is not an unprimeable number, because it can be changed into a prime (21053571315239) 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 7 ways as a sum of consecutive naturals, for example, 19315202497 + ... + 19315203586.
It is an arithmetic number, because the mean of its divisors is an integer number (3187008501930).
Almost surely, 221053571315235 is an apocalyptic number.
21053571315235 is a deficient number, since it is larger than the sum of its proper divisors (4442496700205).
21053571315235 is a wasteful number, since it uses less digits than its factorization.
21053571315235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38630406197.
The product of its (nonzero) digits is 472500, while the sum is 43.
The spelling of 21053571315235 in words is "twenty-one trillion, fifty-three billion, five hundred seventy-one million, three hundred fifteen thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •