Base | Representation |
---|---|
bin | 101111000101010110… |
… | …1100010001100000011 |
3 | 100122222122000100111000 |
4 | 1132022231202030003 |
5 | 3124034012041011 |
6 | 114241105023043 |
7 | 10206431026512 |
oct | 1361255421403 |
9 | 318878010430 |
10 | 101111440131 |
11 | 39976854569 |
12 | 1771a024a83 |
13 | 96c4b67620 |
14 | 4c728da679 |
15 | 296bad0356 |
hex | 178ab62303 |
101111440131 has 32 divisors (see below), whose sum is σ = 161750093120. Its totient is φ = 62055528192.
The previous prime is 101111440103. The next prime is 101111440147. The reversal of 101111440131 is 131044111101.
101111440131 is a `hidden beast` number, since 101 + 111 + 440 + 13 + 1 = 666.
It is not a de Polignac number, because 101111440131 - 25 = 101111440099 is a prime.
It is a super-2 number, since 2×1011114401312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101111440151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 255226 + ... + 517071.
It is an arithmetic number, because the mean of its divisors is an integer number (5054690410).
Almost surely, 2101111440131 is an apocalyptic number.
101111440131 is a deficient number, since it is larger than the sum of its proper divisors (60638652989).
101111440131 is a wasteful number, since it uses less digits than its factorization.
101111440131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772692 (or 772686 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 101111440131 its reverse (131044111101), we get a palindrome (232155551232).
The spelling of 101111440131 in words is "one hundred one billion, one hundred eleven million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •