Base | Representation |
---|---|
bin | 10110111110001110010101… |
… | …111100010110100100111111 |
3 | 111020201122220200000101022110 |
4 | 112332032111330112210333 |
5 | 101220311122010030421 |
6 | 554513533413145103 |
7 | 30165252462441246 |
oct | 2676162574264477 |
9 | 436648820011273 |
10 | 101033031330111 |
11 | 2a2129602952a1 |
12 | b3b8a6592b193 |
13 | 444b4b280a61a |
14 | 1ad404c10395d |
15 | ba317ad41a76 |
hex | 5be395f1693f |
101033031330111 has 8 divisors (see below), whose sum is σ = 134754318264240. Its totient is φ = 67333549308032.
The previous prime is 101033031330107. The next prime is 101033031330181. The reversal of 101033031330111 is 111033130330101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101033031330111 - 22 = 101033031330107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101033031330181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5451217200 + ... + 5451235733.
It is an arithmetic number, because the mean of its divisors is an integer number (16844289783030).
Almost surely, 2101033031330111 is an apocalyptic number.
101033031330111 is a deficient number, since it is larger than the sum of its proper divisors (33721286934129).
101033031330111 is a wasteful number, since it uses less digits than its factorization.
101033031330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10902456025.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 101033031330111 its reverse (111033130330101), we get a palindrome (212066161660212).
The spelling of 101033031330111 in words is "one hundred one trillion, thirty-three billion, thirty-one million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •