Base | Representation |
---|---|
bin | 10110111111010111010101… |
… | …010001110111001000011101 |
3 | 111021000011012112210012202211 |
4 | 112333113111101313020131 |
5 | 101223102123224010123 |
6 | 555013534253320421 |
7 | 30204025555534000 |
oct | 2677272521671035 |
9 | 437004175705684 |
10 | 101111403344413 |
11 | 2a243118245650 |
12 | b410098496111 |
13 | 44559c258b497 |
14 | 1ad7b64981537 |
15 | ba521643440d |
hex | 5bf5d547721d |
101111403344413 has 16 divisors (see below), whose sum is σ = 128633643273600. Its totient is φ = 78788106499200.
The previous prime is 101111403344389. The next prime is 101111403344423. The reversal of 101111403344413 is 314443304111101.
It is a happy number.
It is not a de Polignac number, because 101111403344413 - 217 = 101111403213341 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 (101111403344423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13399334068 + ... + 13399341613.
It is an arithmetic number, because the mean of its divisors is an integer number (8039602704600).
Almost surely, 2101111403344413 is an apocalyptic number.
It is an amenable number.
101111403344413 is a deficient number, since it is larger than the sum of its proper divisors (27522239929187).
101111403344413 is an equidigital number, since it uses as much as digits as its factorization.
101111403344413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26798675713 (or 26798675699 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 101111403344413 its reverse (314443304111101), we get a palindrome (415554707455514).
The spelling of 101111403344413 in words is "one hundred one trillion, one hundred eleven billion, four hundred three million, three hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •