Base | Representation |
---|---|
bin | 1001101101011100001011… |
… | …01011011111111010000111 |
3 | 2210121021121012020122002212 |
4 | 10312232011223133322013 |
5 | 10244314432422413111 |
6 | 113225114211054035 |
7 | 4332445323365213 |
oct | 466560553377207 |
9 | 83537535218085 |
10 | 21352525201031 |
11 | 68926118a9182 |
12 | 248a3195a131b |
13 | bbb6c4361b8b |
14 | 53b679667943 |
15 | 2706651a898b |
hex | 136b85adfe87 |
21352525201031 has 8 divisors (see below), whose sum is σ = 21372436512000. Its totient is φ = 21332614578912.
The previous prime is 21352525201013. The next prime is 21352525201121. The reversal of 21352525201031 is 13010252525312.
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 21352525201031 - 210 = 21352525200007 is a prime.
It is a super-2 number, since 2×213525252010312 (a number of 27 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 (21352525201001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78559241 + ... + 78830573.
It is an arithmetic number, because the mean of its divisors is an integer number (2671554564000).
Almost surely, 221352525201031 is an apocalyptic number.
21352525201031 is a deficient number, since it is larger than the sum of its proper divisors (19911310969).
21352525201031 is a wasteful number, since it uses less digits than its factorization.
21352525201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344425.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 21352525201031 its reverse (13010252525312), we get a palindrome (34362777726343).
The spelling of 21352525201031 in words is "twenty-one trillion, three hundred fifty-two billion, five hundred twenty-five million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •