Base | Representation |
---|---|
bin | 1001101001011001011011… |
… | …11000010110110001100011 |
3 | 2210010000001011211222221001 |
4 | 10310230231320112301203 |
5 | 10240030434441114021 |
6 | 113041222133212431 |
7 | 4316430053143516 |
oct | 464545570266143 |
9 | 83100034758831 |
10 | 21213613223011 |
11 | 6839708699060 |
12 | 2467410191117 |
13 | bab587018891 |
14 | 534a5c73ad7d |
15 | 26bc34c54091 |
hex | 134b2de16c63 |
21213613223011 has 16 divisors (see below), whose sum is σ = 23200989948288. Its totient is φ = 19236052368000.
The previous prime is 21213613222999. The next prime is 21213613223059. The reversal of 21213613223011 is 11032231631212.
It is a cyclic number.
It is not a de Polignac number, because 21213613223011 - 217 = 21213613091939 is a prime.
It is a super-2 number, since 2×212136132230112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21213613223111) 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 15 ways as a sum of consecutive naturals, for example, 97475860 + ... + 97693246.
It is an arithmetic number, because the mean of its divisors is an integer number (1450061871768).
Almost surely, 221213613223011 is an apocalyptic number.
21213613223011 is a deficient number, since it is larger than the sum of its proper divisors (1987376725277).
21213613223011 is a wasteful number, since it uses less digits than its factorization.
21213613223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239922.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 21213613223011 its reverse (11032231631212), we get a palindrome (32245844854223).
The spelling of 21213613223011 in words is "twenty-one trillion, two hundred thirteen billion, six hundred thirteen million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •