Base | Representation |
---|---|
bin | 1001100110101011010010… |
… | …10000110100011010110010 |
3 | 2202210001201111020220022000 |
4 | 10303111221100310122302 |
5 | 10232013001233223442 |
6 | 112530241013354430 |
7 | 4306610160514032 |
oct | 463255120643262 |
9 | 82701644226260 |
10 | 21120120211122 |
11 | 6802aa1293489 |
12 | 2451279638a16 |
13 | ba280763597a |
14 | 53030d97d8c2 |
15 | 2695b1dead4c |
hex | 1335694346b2 |
21120120211122 has 16 divisors (see below), whose sum is σ = 46933600469280. Its totient is φ = 7040040070356.
The previous prime is 21120120211087. The next prime is 21120120211181. The reversal of 21120120211122 is 22111202102112.
21120120211122 is a `hidden beast` number, since 211 + 2 + 0 + 120 + 211 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21120120211095 and 21120120211104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195556668568 + ... + 195556668675.
It is an arithmetic number, because the mean of its divisors is an integer number (2933350029330).
Almost surely, 221120120211122 is an apocalyptic number.
21120120211122 is an abundant number, since it is smaller than the sum of its proper divisors (25813480258158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21120120211122 is a wasteful number, since it uses less digits than its factorization.
21120120211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391113337254 (or 391113337248 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21120120211122 its reverse (22111202102112), we get a palindrome (43231322313234).
The spelling of 21120120211122 in words is "twenty-one trillion, one hundred twenty billion, one hundred twenty million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •