Base | Representation |
---|---|
bin | 1001101100010010110010… |
… | …00000011100001000101111 |
3 | 2210110111220001022100011111 |
4 | 10312021121000130020233 |
5 | 10243143232434311343 |
6 | 113155040154332451 |
7 | 4326552002320360 |
oct | 466113100341057 |
9 | 83414801270144 |
10 | 21313121010223 |
11 | 68779311a6429 |
12 | 248276112a127 |
13 | bb7a8486b843 |
14 | 5397bc271b67 |
15 | 26e60ab62c9d |
hex | 13625901c22f |
21313121010223 has 16 divisors (see below), whose sum is σ = 24519968167936. Its totient is φ = 18146918734560.
The previous prime is 21313121010211. The next prime is 21313121010253. The reversal of 21313121010223 is 32201012131312.
It is not a de Polignac number, because 21313121010223 - 29 = 21313121009711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21313121010194 and 21313121010203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21313121010253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2626143 + ... + 7037248.
It is an arithmetic number, because the mean of its divisors is an integer number (1532498010496).
Almost surely, 221313121010223 is an apocalyptic number.
21313121010223 is a deficient number, since it is larger than the sum of its proper divisors (3206847157713).
21313121010223 is a wasteful number, since it uses less digits than its factorization.
21313121010223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9665494.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21313121010223 its reverse (32201012131312), we get a palindrome (53514133141535).
The spelling of 21313121010223 in words is "twenty-one trillion, three hundred thirteen billion, one hundred twenty-one million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •