Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1111000001101000101101 |
3 | 1022210111221022212200211200 |
4 | 2103013300333001220231 |
5 | 2311120441340213401 |
6 | 33300303305440113 |
7 | 2062300505304201 |
oct | 223076077015055 |
9 | 38714838780750 |
10 | 10110101101101 |
11 | 3248740557961 |
12 | 11734a44a0039 |
13 | 5844bc593161 |
14 | 26d48d90cb01 |
15 | 127ec0d5b686 |
hex | 931f0fc1a2d |
10110101101101 has 6 divisors (see below), whose sum is σ = 14603479368270. Its totient is φ = 6740067400728.
The previous prime is 10110101101081. The next prime is 10110101101123. The reversal of 10110101101101 is 10110110101101.
10110101101101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 5583291684201 + 4526809416900 = 2362899^2 + 2127630^2 .
It is not a de Polignac number, because 10110101101101 - 25 = 10110101101069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1123344566789 = 10110101101101 / (1 + 0 + 1 + 1 + 0 + 1 + 0 + 1 + 1 + 0 + 1 + 1 + 0 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110101101171) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 561672283386 + ... + 561672283403.
It is an arithmetic number, because the mean of its divisors is an integer number (2433913228045).
Almost surely, 210110101101101 is an apocalyptic number.
It is an amenable number.
10110101101101 is a deficient number, since it is larger than the sum of its proper divisors (4493378267169).
10110101101101 is a wasteful number, since it uses less digits than its factorization.
10110101101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123344566795 (or 1123344566792 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10110101101101 its reverse (10110110101101), we get a palindrome (20220211202202).
Subtracting 10110101101101 from its reverse (10110110101101), we obtain a square (9000000 = 30002).
It can be divided in two parts, 10110101101 and 101, that multiplied together give a palindrome (1021120211201).
The spelling of 10110101101101 in words is "ten trillion, one hundred ten billion, one hundred one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •