Base | Representation |
---|---|
bin | 1001101100010011001000… |
… | …11101010100111010110011 |
3 | 2210110112101102211010222200 |
4 | 10312021210131110322303 |
5 | 10243144131130212321 |
6 | 113155111220234243 |
7 | 4326556524323652 |
oct | 466114435247263 |
9 | 83415342733880 |
10 | 21313313132211 |
11 | 6877a1a698531 |
12 | 24827b553b983 |
13 | bb7ab55c80a9 |
14 | 5397d99a3199 |
15 | 26e61c962d26 |
hex | 136264754eb3 |
21313313132211 has 24 divisors (see below), whose sum is σ = 32124873449760. Its totient is φ = 13590903845376.
The previous prime is 21313313132179. The next prime is 21313313132261. The reversal of 21313313132211 is 11223131331312.
21313313132211 is a `hidden beast` number, since 2 + 1 + 3 + 1 + 3 + 313 + 132 + 211 = 666.
It is not a de Polignac number, because 21313313132211 - 25 = 21313313132179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21313313132261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14535075 + ... + 15934083.
It is an arithmetic number, because the mean of its divisors is an integer number (1338536393740).
Almost surely, 221313313132211 is an apocalyptic number.
21313313132211 is a deficient number, since it is larger than the sum of its proper divisors (10811560317549).
21313313132211 is a wasteful number, since it uses less digits than its factorization.
21313313132211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472635 (or 1472632 counting only the distinct ones).
The product of its digits is 1944, while the sum is 27.
Adding to 21313313132211 its reverse (11223131331312), we get a palindrome (32536444463523).
The spelling of 21313313132211 in words is "twenty-one trillion, three hundred thirteen billion, three hundred thirteen million, one hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •