Base | Representation |
---|---|
bin | 1001110010101010101101… |
… | …00011111000000100111001 |
3 | 2211020110011200202100222211 |
4 | 10321111112203320010321 |
5 | 10310240242031101103 |
6 | 113443415413415121 |
7 | 4351434042135514 |
oct | 471252643700471 |
9 | 84213150670884 |
10 | 21532123300153 |
11 | 69517a4297274 |
12 | 24b90a063a4a1 |
13 | c0261694a84b |
14 | 546235d25d7b |
15 | 27517747536d |
hex | 1395568f8139 |
21532123300153 has 4 divisors (see below), whose sum is σ = 21791546472528. Its totient is φ = 21272700127780.
The previous prime is 21532123300147. The next prime is 21532123300157. The reversal of 21532123300153 is 35100332123512.
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 a de Polignac number, because none of the positive numbers 2k-21532123300153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21532123300157) 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, 129711586063 + ... + 129711586228.
It is an arithmetic number, because the mean of its divisors is an integer number (5447886618132).
Almost surely, 221532123300153 is an apocalyptic number.
It is an amenable number.
21532123300153 is a deficient number, since it is larger than the sum of its proper divisors (259423172375).
21532123300153 is an equidigital number, since it uses as much as digits as its factorization.
21532123300153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259423172374.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 21532123300153 its reverse (35100332123512), we get a palindrome (56632455423665).
The spelling of 21532123300153 in words is "twenty-one trillion, five hundred thirty-two billion, one hundred twenty-three million, three hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •