Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0000110000000101110 |
3 | 100122221220120002000000 |
4 | 1132022012012000232 |
5 | 3124023340213402 |
6 | 114240055245130 |
7 | 10206244115541 |
oct | 1361206060056 |
9 | 318856502000 |
10 | 101101101102 |
11 | 39970a32711 |
12 | 177166797a6 |
13 | 96c2987661 |
14 | 4c713a8858 |
15 | 296ac3bc1c |
hex | 178a18602e |
101101101102 has 112 divisors (see below), whose sum is σ = 236165227008. Its totient is φ = 32410815120.
The previous prime is 101101101097. The next prime is 101101101113. The reversal of 101101101102 is 201101101101.
It is a super-2 number, since 2×1011011011022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 7360413 + ... + 7374135.
Almost surely, 2101101101102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101101101102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118082613504).
101101101102 is an abundant number, since it is smaller than the sum of its proper divisors (135064125906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101101102 is a wasteful number, since it uses less digits than its factorization.
101101101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13937 (or 13922 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101101101102 its reverse (201101101101), we get a palindrome (302202202203).
Subtracting 101101101102 from its reverse (201101101101), we obtain a palindrome (99999999999).
The spelling of 101101101102 in words is "one hundred one billion, one hundred one million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •