Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …101101001001110011001000 |
3 | 111020121112012100222111202211 |
4 | 112331233301231021303020 |
5 | 101214241413021023422 |
6 | 554450504554034504 |
7 | 30163011246253465 |
oct | 2675576155116310 |
9 | 436545170874684 |
10 | 101000211111112 |
11 | 2a1aaa49113a65 |
12 | b3b2626418a34 |
13 | 44483820892b1 |
14 | 1ad26172d066c |
15 | ba23a9837577 |
hex | 5bdbf1b49cc8 |
101000211111112 has 8 divisors (see below), whose sum is σ = 189375395833350. Its totient is φ = 50500105555552.
The previous prime is 101000211111091. The next prime is 101000211111127. The reversal of 101000211111112 is 211111112000101.
It can be written as a sum of positive squares in only one way, i.e., 53017242314436 + 47982968796676 = 7281294^2 + 6926974^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 101000211111092 and 101000211111101.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6312513194437 + ... + 6312513194452.
Almost surely, 2101000211111112 is an apocalyptic number.
It is an amenable number.
101000211111112 is a deficient number, since it is larger than the sum of its proper divisors (88375184722238).
101000211111112 is a wasteful number, since it uses less digits than its factorization.
101000211111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12625026388895 (or 12625026388891 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101000211111112 its reverse (211111112000101), we get a palindrome (312111323111213).
It can be divided in two parts, 101000 and 211111112, that added together give a palindrome (211212112).
The spelling of 101000211111112 in words is "one hundred one trillion, two hundred eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •