Base | Representation |
---|---|
bin | 101111000101111111… |
… | …1110010010110010101 |
3 | 100200001010120210222200 |
4 | 1132023333302112111 |
5 | 3124110022032013 |
6 | 114243155115113 |
7 | 10210112222502 |
oct | 1361377622625 |
9 | 320033523880 |
10 | 101133002133 |
11 | 39987a413a9 |
12 | 177252a2a99 |
13 | 96c94769c7 |
14 | 4c757104a9 |
15 | 296d93de73 |
hex | 178bff2595 |
101133002133 has 24 divisors (see below), whose sum is σ = 146771206296. Its totient is φ = 67103769600.
The previous prime is 101133002111. The next prime is 101133002161. The reversal of 101133002133 is 331200331101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10386259569 + 90746742564 = 101913^2 + 301242^2 .
It is not a de Polignac number, because 101133002133 - 28 = 101133001877 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101133002183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4058793 + ... + 4083633.
It is an arithmetic number, because the mean of its divisors is an integer number (6115466929).
Almost surely, 2101133002133 is an apocalyptic number.
It is an amenable number.
101133002133 is a deficient number, since it is larger than the sum of its proper divisors (45638204163).
101133002133 is a wasteful number, since it uses less digits than its factorization.
101133002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26965 (or 26962 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 101133002133 its reverse (331200331101), we get a palindrome (432333333234).
The spelling of 101133002133 in words is "one hundred one billion, one hundred thirty-three million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •