Base | Representation |
---|---|
bin | 1001110010110100010111… |
… | …11111100011001101011101 |
3 | 2211020221120111022112121211 |
4 | 10321122023333203031131 |
5 | 10310331410031330321 |
6 | 113450034503424421 |
7 | 4352006510341300 |
oct | 471321377431535 |
9 | 84227514275554 |
10 | 21537314714461 |
11 | 6953a18752717 |
12 | 24ba0ab155111 |
13 | c02c63348830 |
14 | 5465a95b2b37 |
15 | 27537d0dc0e1 |
hex | 13968bfe335d |
21537314714461 has 12 divisors (see below), whose sum is σ = 26980811840892. Its totient is φ = 17040512740608.
The previous prime is 21537314714413. The next prime is 21537314714483. The reversal of 21537314714461 is 16441741373512.
It can be written as a sum of positive squares in 2 ways, for example, as 5403676825561 + 16133637888900 = 2324581^2 + 4016670^2 .
It is not a de Polignac number, because 21537314714461 - 229 = 21536777843549 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21537314714161) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16905269940 + ... + 16905271213.
It is an arithmetic number, because the mean of its divisors is an integer number (2248400986741).
Almost surely, 221537314714461 is an apocalyptic number.
It is an amenable number.
21537314714461 is a deficient number, since it is larger than the sum of its proper divisors (5443497126431).
21537314714461 is a wasteful number, since it uses less digits than its factorization.
21537314714461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33810541180 (or 33810541173 counting only the distinct ones).
The product of its digits is 1693440, while the sum is 49.
The spelling of 21537314714461 in words is "twenty-one trillion, five hundred thirty-seven billion, three hundred fourteen million, seven hundred fourteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •