Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0001010111001001101 |
3 | 100122221220121002102201 |
4 | 1132022012022321031 |
5 | 3124023341333401 |
6 | 114240055521501 |
7 | 10206244231051 |
oct | 1361206127115 |
9 | 318856532381 |
10 | 101101121101 |
11 | 39970a46742 |
12 | 17716689291 |
13 | 96c29937a6 |
14 | 4c713b1c61 |
15 | 296ac42b01 |
hex | 178a18ae4d |
101101121101 has 4 divisors (see below), whose sum is σ = 103252208832. Its totient is φ = 98950033372.
The previous prime is 101101121081. The next prime is 101101121273. The reversal of 101101121101 is 101121101101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101101121101 - 223 = 101092732493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101124101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1075543795 + ... + 1075543888.
It is an arithmetic number, because the mean of its divisors is an integer number (25813052208).
Almost surely, 2101101121101 is an apocalyptic number.
It is an amenable number.
101101121101 is a deficient number, since it is larger than the sum of its proper divisors (2151087731).
101101121101 is an equidigital number, since it uses as much as digits as its factorization.
101101121101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2151087730.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101101121101 its reverse (101121101101), we get a palindrome (202222222202).
It can be divided in two parts, 101 and 101121101, that multiplied together give a palindrome (10213231201).
The spelling of 101101121101 in words is "one hundred one billion, one hundred one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •