Base | Representation |
---|---|
bin | 10110111111110011000001… |
… | …001101000000110101101011 |
3 | 111021002222221100011211122110 |
4 | 112333303001031000311223 |
5 | 101224044014103101303 |
6 | 555035332210453403 |
7 | 30206130343146021 |
oct | 2677630115006553 |
9 | 437088840154573 |
10 | 101141131300203 |
11 | 2a254792969855 |
12 | b4159b4294263 |
13 | 445874c493177 |
14 | 1ad9384c12711 |
15 | ba5da6222703 |
hex | 5bfcc1340d6b |
101141131300203 has 8 divisors (see below), whose sum is σ = 134855123464768. Its totient is φ = 67427280001224.
The previous prime is 101141131300201. The next prime is 101141131300229. The reversal of 101141131300203 is 302003131141101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101141131300203 - 21 = 101141131300201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101141131300203.
It is not an unprimeable number, because it can be changed into a prime (101141131300201) 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, 33529525 + ... + 36421302.
It is an arithmetic number, because the mean of its divisors is an integer number (16856890433096).
Almost surely, 2101141131300203 is an apocalyptic number.
101141131300203 is a deficient number, since it is larger than the sum of its proper divisors (33713992164565).
101141131300203 is an equidigital number, since it uses as much as digits as its factorization.
101141131300203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70432793.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 101141131300203 its reverse (302003131141101), we get a palindrome (403144262441304).
The spelling of 101141131300203 in words is "one hundred one trillion, one hundred forty-one billion, one hundred thirty-one million, three hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.821 sec. • engine limits •