Base | Representation |
---|---|
bin | 1001101101100100101111… |
… | …11110100011011100011101 |
3 | 2210121201110220122001000120 |
4 | 10312302113332203130131 |
5 | 10244403344022402222 |
6 | 113231155002545153 |
7 | 4333000343342115 |
oct | 466622776433435 |
9 | 83551426561016 |
10 | 21357127153437 |
11 | 6894563554129 |
12 | 248b1a28081b9 |
13 | bbbc788b3a3a |
14 | 53b994912045 |
15 | 2708341d515c |
hex | 136c97fa371d |
21357127153437 has 64 divisors (see below), whose sum is σ = 30501519750144. Its totient is φ = 13245471544320.
The previous prime is 21357127153379. The next prime is 21357127153513. The reversal of 21357127153437 is 73435172175312.
It is not a de Polignac number, because 21357127153437 - 28 = 21357127153181 is a prime.
It is a super-2 number, since 2×213571271534372 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 21357127153437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21357127153237) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6458155938 + ... + 6458159244.
It is an arithmetic number, because the mean of its divisors is an integer number (476586246096).
Almost surely, 221357127153437 is an apocalyptic number.
It is an amenable number.
21357127153437 is a deficient number, since it is larger than the sum of its proper divisors (9144392596707).
21357127153437 is a wasteful number, since it uses less digits than its factorization.
21357127153437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5738.
The product of its digits is 3704400, while the sum is 51.
The spelling of 21357127153437 in words is "twenty-one trillion, three hundred fifty-seven billion, one hundred twenty-seven million, one hundred fifty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •