Base | Representation |
---|---|
bin | 101111111110110001100011… |
… | …111100100111010010010011 |
3 | 1000200011111200201000122121012 |
4 | 233332301203330213102103 |
5 | 210124341034031133021 |
6 | 2024450101220121135 |
7 | 62306560061554460 |
oct | 5776614374472223 |
9 | 1020144621018535 |
10 | 211022010021011 |
11 | 61268a28362872 |
12 | 1b8015902361ab |
13 | 90993a06331b7 |
14 | 3a1773c3c8667 |
15 | 195e277ba635b |
hex | bfec63f27493 |
211022010021011 has 32 divisors (see below), whose sum is σ = 254247237144576. Its totient is φ = 171330698448000.
The previous prime is 211022010020959. The next prime is 211022010021113. The reversal of 211022010021011 is 110120010220112.
It is not a de Polignac number, because 211022010021011 - 214 = 211022010004627 is a prime.
It is a super-2 number, since 2×2110220100210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211022010024011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16949225 + ... + 26633066.
It is an arithmetic number, because the mean of its divisors is an integer number (7945226160768).
Almost surely, 2211022010021011 is an apocalyptic number.
211022010021011 is a deficient number, since it is larger than the sum of its proper divisors (43225227123565).
211022010021011 is a wasteful number, since it uses less digits than its factorization.
211022010021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43582803.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211022010021011 its reverse (110120010220112), we get a palindrome (321142020241123).
The spelling of 211022010021011 in words is "two hundred eleven trillion, twenty-two billion, ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •