Base | Representation |
---|---|
bin | 101111000101000001… |
… | …0010100100100000101 |
3 | 100122221211200211101112 |
4 | 1132022002110210011 |
5 | 3124023112042013 |
6 | 114240022134405 |
7 | 10206232526336 |
oct | 1361202244405 |
9 | 318854624345 |
10 | 101100112133 |
11 | 39970417689 |
12 | 17716281405 |
13 | 96c26cc477 |
14 | 4c711cc28d |
15 | 296aae3ba8 |
hex | 178a094905 |
101100112133 has 4 divisors (see below), whose sum is σ = 101236919520. Its totient is φ = 100963304748.
The previous prime is 101100112103. The next prime is 101100112147. The reversal of 101100112133 is 331211001101.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 331211001101 = 191 ⋅1734089011.
It is a cyclic number.
It is not a de Polignac number, because 101100112133 - 228 = 100831676677 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 (101100112103) 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, 68402585 + ... + 68404062.
It is an arithmetic number, because the mean of its divisors is an integer number (25309229880).
Almost surely, 2101100112133 is an apocalyptic number.
It is an amenable number.
101100112133 is a deficient number, since it is larger than the sum of its proper divisors (136807387).
101100112133 is an equidigital number, since it uses as much as digits as its factorization.
101100112133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136807386.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101100112133 its reverse (331211001101), we get a palindrome (432311113234).
The spelling of 101100112133 in words is "one hundred one billion, one hundred million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •