Base | Representation |
---|---|
bin | 10110111111100001001101… |
… | …100011101010000100010010 |
3 | 111021001011120211100121201112 |
4 | 112333201031203222010102 |
5 | 101223240334332210002 |
6 | 555022451032533322 |
7 | 30204552464104556 |
oct | 2677411543520422 |
9 | 437034524317645 |
10 | 101122011210002 |
11 | 2a2476710a0012 |
12 | b412158b51242 |
13 | 44569c3199723 |
14 | 1ad848d737866 |
15 | ba5637865852 |
hex | 5bf84d8ea112 |
101122011210002 has 16 divisors (see below), whose sum is σ = 154883208481272. Its totient is φ = 49504386240000.
The previous prime is 101122011209993. The next prime is 101122011210007. The reversal of 101122011210002 is 200012110221101.
It can be written as a sum of positive squares in 4 ways, for example, as 92807963748721 + 8314047461281 = 9633689^2 + 2883409^2 .
It is a super-2 number, since 2×1011220112100022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101122011210007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2527777499 + ... + 2527817502.
Almost surely, 2101122011210002 is an apocalyptic number.
101122011210002 is a deficient number, since it is larger than the sum of its proper divisors (53761197271270).
101122011210002 is a wasteful number, since it uses less digits than its factorization.
101122011210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055595213.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101122011210002 its reverse (200012110221101), we get a palindrome (301134121431103).
The spelling of 101122011210002 in words is "one hundred one trillion, one hundred twenty-two billion, eleven million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •