Base | Representation |
---|---|
bin | 10110111101111001111010… |
… | …110011001010011111100010 |
3 | 111020122120022022102021010200 |
4 | 112331321322303022133202 |
5 | 101214431213340200002 |
6 | 554455505332210030 |
7 | 30163545151530312 |
oct | 2675717263123742 |
9 | 436576268367120 |
10 | 101011101100002 |
11 | 2a204627242885 |
12 | b3b4765469916 |
13 | 44493c92764c2 |
14 | 1ad2d6b725442 |
15 | ba27e58e5b1c |
hex | 5bde7acca7e2 |
101011101100002 has 24 divisors (see below), whose sum is σ = 219330079872384. Its totient is φ = 33597644855544.
The previous prime is 101011101099971. The next prime is 101011101100031. The reversal of 101011101100002 is 200001101110101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 6060172918 + ... + 6060189585.
It is an arithmetic number, because the mean of its divisors is an integer number (9138753328016).
Almost surely, 2101011101100002 is an apocalyptic number.
101011101100002 is an abundant number, since it is smaller than the sum of its proper divisors (118318978772382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011101100002 is a wasteful number, since it uses less digits than its factorization.
101011101100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12120362974 (or 12120362971 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101011101100002 its reverse (200001101110101), we get a palindrome (301012202210103).
The spelling of 101011101100002 in words is "one hundred one trillion, eleven billion, one hundred one million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •