Base | Representation |
---|---|
bin | 110000000001011000010111… |
… | …110011001010100100100000 |
3 | 1000200210122000021010022100200 |
4 | 300001120113303022210200 |
5 | 210140304344000231422 |
6 | 2025104242224145200 |
7 | 62325530444620341 |
oct | 6001302763124440 |
9 | 1020718007108320 |
10 | 211201121102112 |
11 | 6132798a951029 |
12 | 1b830238168200 |
13 | 90b0246060a1b |
14 | 3a222901100c8 |
15 | 1963c5c3212ac |
hex | c01617cca920 |
211201121102112 has 36 divisors (see below), whose sum is σ = 600603188134950. Its totient is φ = 70400373700608.
The previous prime is 211201121102093. The next prime is 211201121102141.
It is a happy number.
211201121102112 is a `hidden beast` number, since 211 + 20 + 11 + 211 + 0 + 211 + 2 = 666.
211201121102112 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in only one way, i.e., 210212997628176 + 988123473936 = 14498724^2 + 994044^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 366668612737 + ... + 366668613312.
Almost surely, 2211201121102112 is an apocalyptic number.
It is an amenable number.
211201121102112 is an abundant number, since it is smaller than the sum of its proper divisors (389402067032838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211201121102112 is a wasteful number, since it uses less digits than its factorization.
211201121102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 733337226065 (or 733337226054 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
The spelling of 211201121102112 in words is "two hundred eleven trillion, two hundred one billion, one hundred twenty-one million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •