Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0000110010000100000 |
3 | 100122221220120010101102 |
4 | 1132022012012100200 |
5 | 3124023340231422 |
6 | 114240055253532 |
7 | 10206244121513 |
oct | 1361206062040 |
9 | 318856503342 |
10 | 101101102112 |
11 | 39970a3344a |
12 | 1771667a2a8 |
13 | 96c2987c5a |
14 | 4c713a8d7a |
15 | 296ac3c192 |
hex | 178a186420 |
101101102112 has 12 divisors (see below), whose sum is σ = 199042794846. Its totient is φ = 50550551040.
The previous prime is 101101102087. The next prime is 101101102127. The reversal of 101101102112 is 211201101101.
101101102112 is digitally balanced in base 3, 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., 94694060176 + 6407041936 = 307724^2 + 80044^2 .
It is a super-2 number, since 2×1011011021122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101101102093 and 101101102102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1579704689 + ... + 1579704752.
Almost surely, 2101101102112 is an apocalyptic number.
It is an amenable number.
101101102112 is a deficient number, since it is larger than the sum of its proper divisors (97941692734).
101101102112 is an equidigital number, since it uses as much as digits as its factorization.
101101102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3159409451 (or 3159409443 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101101102112 its reverse (211201101101), we get a palindrome (312302203213).
The spelling of 101101102112 in words is "one hundred one billion, one hundred one million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •