Base | Representation |
---|---|
bin | 1001100110101011011101… |
… | …10011010111111011010101 |
3 | 2202210001221222010222001220 |
4 | 10303111232303113323111 |
5 | 10232013144031434131 |
6 | 112530254133440553 |
7 | 4306612366522023 |
oct | 463255663277325 |
9 | 82701858128056 |
10 | 21120213155541 |
11 | 68030397a5a55 |
12 | 24512a47a0159 |
13 | ba2820978b76 |
14 | 53031c055713 |
15 | 2695ba159e96 |
hex | 13356ecd7ed5 |
21120213155541 has 8 divisors (see below), whose sum is σ = 28580586957024. Its totient is φ = 13869990728880.
The previous prime is 21120213155519. The next prime is 21120213155549. The reversal of 21120213155541 is 14555131202112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21120213155541 - 215 = 21120213122773 is a prime.
It is a super-3 number, since 3×211202131555413 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120213155549) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52537843470 + ... + 52537843871.
It is an arithmetic number, because the mean of its divisors is an integer number (3572573369628).
Almost surely, 221120213155541 is an apocalyptic number.
It is an amenable number.
21120213155541 is a deficient number, since it is larger than the sum of its proper divisors (7460373801483).
21120213155541 is a wasteful number, since it uses less digits than its factorization.
21120213155541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105075687411.
The product of its (nonzero) digits is 12000, while the sum is 33.
Adding to 21120213155541 its reverse (14555131202112), we get a palindrome (35675344357653).
The spelling of 21120213155541 in words is "twenty-one trillion, one hundred twenty billion, two hundred thirteen million, one hundred fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •