Base | Representation |
---|---|
bin | 1001100110101111001011… |
… | …10101100010010111111010 |
3 | 2202210021010010221220120211 |
4 | 10303113211311202113322 |
5 | 10232031241303230242 |
6 | 112531224233341334 |
7 | 4310013026312053 |
oct | 463274565422772 |
9 | 82707103856524 |
10 | 21122210211322 |
11 | 6803974011580 |
12 | 245176156784a |
13 | ba2a7b63208c |
14 | 53046b38572a |
15 | 26968563a317 |
hex | 1335e5d625fa |
21122210211322 has 32 divisors (see below), whose sum is σ = 34887217622400. Its totient is φ = 9511148347200.
The previous prime is 21122210211281. The next prime is 21122210211371. The reversal of 21122210211322 is 22311201222112.
It is a super-2 number, since 2×211222102113222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 21122210211293 and 21122210211302.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12085179 + ... + 13722097.
It is an arithmetic number, because the mean of its divisors is an integer number (1090225550700).
Almost surely, 221122210211322 is an apocalyptic number.
21122210211322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21122210211322 is a deficient number, since it is larger than the sum of its proper divisors (13765007411078).
21122210211322 is a wasteful number, since it uses less digits than its factorization.
21122210211322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642422.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 21122210211322 its reverse (22311201222112), we get a palindrome (43433411433434).
The spelling of 21122210211322 in words is "twenty-one trillion, one hundred twenty-two billion, two hundred ten million, two hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •