Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …001001011101001100011101 |
3 | 111021210011210112100101002011 |
4 | 113002210020021131030131 |
5 | 101240203000312024013 |
6 | 555302542344231221 |
7 | 30225642036315151 |
oct | 2702441011351435 |
9 | 437704715311064 |
10 | 101331300111133 |
11 | 2a3183aa236104 |
12 | b44682746b511 |
13 | 4470667a7bbb1 |
14 | 1b04665355061 |
15 | baacd6531c3d |
hex | 5c290825d31d |
101331300111133 has 8 divisors (see below), whose sum is σ = 101717909682048. Its totient is φ = 100944700536624.
The previous prime is 101331300111131. The next prime is 101331300111149. The reversal of 101331300111133 is 331111003133101.
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 101331300111133 - 21 = 101331300111131 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 (101331300111131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18137560 + ... + 23057182.
It is an arithmetic number, because the mean of its divisors is an integer number (12714738710256).
Almost surely, 2101331300111133 is an apocalyptic number.
It is an amenable number.
101331300111133 is a deficient number, since it is larger than the sum of its proper divisors (386609570915).
101331300111133 is an equidigital number, since it uses as much as digits as its factorization.
101331300111133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4998203.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 101331300111133 its reverse (331111003133101), we get a palindrome (432442303244234).
The spelling of 101331300111133 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •