Base | Representation |
---|---|
bin | 10111000000101010111000… |
… | …010001011101001101110011 |
3 | 111021022201202102120220111120 |
4 | 113000222320101131031303 |
5 | 101231034333404342321 |
6 | 555123052032113323 |
7 | 30213352605245040 |
oct | 2700527021351563 |
9 | 437281672526446 |
10 | 101201111012211 |
11 | 2a27817194a181 |
12 | b425553395843 |
13 | 44612ba968b12 |
14 | 1adc234b041c7 |
15 | ba7716cb8ec6 |
hex | 5c0ab845d373 |
101201111012211 has 16 divisors (see below), whose sum is σ = 154254693414144. Its totient is φ = 57812902555104.
The previous prime is 101201111012203. The next prime is 101201111012297. The reversal of 101201111012211 is 112210111102101.
It is not a de Polignac number, because 101201111012211 - 23 = 101201111012203 is a prime.
It is a super-2 number, since 2×1012011110122112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101201111012411) 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 15 ways as a sum of consecutive naturals, for example, 679246140 + ... + 679395113.
It is an arithmetic number, because the mean of its divisors is an integer number (9640918338384).
Almost surely, 2101201111012211 is an apocalyptic number.
101201111012211 is a deficient number, since it is larger than the sum of its proper divisors (53053582401933).
101201111012211 is a wasteful number, since it uses less digits than its factorization.
101201111012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358644810.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101201111012211 its reverse (112210111102101), we get a palindrome (213411222114312).
The spelling of 101201111012211 in words is "one hundred one trillion, two hundred one billion, one hundred eleven million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •