Base | Representation |
---|---|
bin | 110000000001100000110110… |
… | …010000101110011000000110 |
3 | 1000200211111111112021000012102 |
4 | 300001200312100232120012 |
5 | 210140432013324231042 |
6 | 2025112345254152102 |
7 | 62326302125056643 |
oct | 6001406620563006 |
9 | 1020744445230172 |
10 | 211210222102022 |
11 | 61330830156a60 |
12 | 1b831b58052632 |
13 | 90b1066714980 |
14 | 3a228b4ad6dca |
15 | 19640e12edb32 |
hex | c0183642e606 |
211210222102022 has 16 divisors (see below), whose sum is σ = 372202629159312. Its totient is φ = 88619673609120.
The previous prime is 211210222101937. The next prime is 211210222102051. The reversal of 211210222102022 is 220201222012112.
It is a junction number, because it is equal to n+sod(n) for n = 211210222101985 and 211210222102003.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369248639753 + ... + 369248640324.
It is an arithmetic number, because the mean of its divisors is an integer number (23262664322457).
Almost surely, 2211210222102022 is an apocalyptic number.
211210222102022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211210222102022 is a deficient number, since it is larger than the sum of its proper divisors (160992407057290).
211210222102022 is a wasteful number, since it uses less digits than its factorization.
211210222102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738497280103.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 211210222102022 its reverse (220201222012112), we get a palindrome (431411444114134).
The spelling of 211210222102022 in words is "two hundred eleven trillion, two hundred ten billion, two hundred twenty-two million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •