Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0101010001111100101101 |
3 | 1022202122110010121210121122 |
4 | 2102333102211101330231 |
5 | 2310443322240213401 |
6 | 33252200313110325 |
7 | 2061526136501021 |
oct | 222772245217455 |
9 | 38678403553548 |
10 | 10101001101101 |
11 | 32448a08751a9 |
12 | 11717849b83a5 |
13 | 58369c19c381 |
14 | 26cc69106381 |
15 | 127b3beca21b |
hex | 92fd2951f2d |
10101001101101 has 8 divisors (see below), whose sum is σ = 10224385387104. Its totient is φ = 9977656945680.
The previous prime is 10101001101073. The next prime is 10101001101131. The reversal of 10101001101101 is 10110110010101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10101001101101 - 210 = 10101001100077 is a prime.
It is a super-2 number, since 2×101010011011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101001101131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9526010 + ... + 10533131.
It is an arithmetic number, because the mean of its divisors is an integer number (1278048173388).
Almost surely, 210101001101101 is an apocalyptic number.
It is an amenable number.
10101001101101 is a deficient number, since it is larger than the sum of its proper divisors (123384286003).
10101001101101 is an equidigital number, since it uses as much as digits as its factorization.
10101001101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20065291.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10101001101101 its reverse (10110110010101), we get a palindrome (20211111111202).
The spelling of 10101001101101 in words is "ten trillion, one hundred one billion, one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •