Base | Representation |
---|---|
bin | 10110111101111011110010… |
… | …100111000101100111010011 |
3 | 111020122202111101202221020120 |
4 | 112331323302213011213103 |
5 | 101214444322431401321 |
6 | 554500441015441323 |
7 | 30163646030226630 |
oct | 2675736247054723 |
9 | 436582441687216 |
10 | 101013111200211 |
11 | 2a205468958921 |
12 | b3b5026686243 |
13 | 4449659848c02 |
14 | 1ad30bc68d187 |
15 | ba28b2100ec6 |
hex | 5bdef29c59d3 |
101013111200211 has 16 divisors (see below), whose sum is σ = 153925397983488. Its totient is φ = 57721531413600.
The previous prime is 101013111200171. The next prime is 101013111200227. The reversal of 101013111200211 is 112002111310101.
It is not a de Polignac number, because 101013111200211 - 218 = 101013110938067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101013111200231) 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 15 ways as a sum of consecutive naturals, for example, 5172205 + ... + 15125406.
It is an arithmetic number, because the mean of its divisors is an integer number (9620337373968).
Almost surely, 2101013111200211 is an apocalyptic number.
101013111200211 is a deficient number, since it is larger than the sum of its proper divisors (52912286783277).
101013111200211 is a wasteful number, since it uses less digits than its factorization.
101013111200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20534602.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 101013111200211 its reverse (112002111310101), we get a palindrome (213015222510312).
The spelling of 101013111200211 in words is "one hundred one trillion, thirteen billion, one hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •