Base | Representation |
---|---|
bin | 1001101001101000100011… |
… | …10110111011000110010111 |
3 | 2210010210000001200102110220 |
4 | 10310310101312323012113 |
5 | 10240144102123120210 |
6 | 113045043552445423 |
7 | 4320135220241301 |
oct | 464642166730627 |
9 | 83123001612426 |
10 | 21221733020055 |
11 | 68420a5049827 |
12 | 2468ab7549873 |
13 | bac27c314409 |
14 | 5351cccaa971 |
15 | 26c05ca14c70 |
hex | 134d11dbb197 |
21221733020055 has 64 divisors (see below), whose sum is σ = 37752849530880. Its totient is φ = 10135352707200.
The previous prime is 21221733019987. The next prime is 21221733020057. The reversal of 21221733020055 is 55002033712212.
It is not a de Polignac number, because 21221733020055 - 211 = 21221733018007 is a prime.
It is a super-2 number, since 2×212217330200552 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21221733019998 and 21221733020025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221733020057) 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, 27550411 + ... + 28310220.
It is an arithmetic number, because the mean of its divisors is an integer number (589888273920).
Almost surely, 221221733020055 is an apocalyptic number.
21221733020055 is a deficient number, since it is larger than the sum of its proper divisors (16531116510825).
21221733020055 is a wasteful number, since it uses less digits than its factorization.
21221733020055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55860732.
The product of its (nonzero) digits is 25200, while the sum is 33.
Adding to 21221733020055 its reverse (55002033712212), we get a palindrome (76223766732267).
The spelling of 21221733020055 in words is "twenty-one trillion, two hundred twenty-one billion, seven hundred thirty-three million, twenty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •