Base | Representation |
---|---|
bin | 101111001100001111… |
… | …0101000010100110011 |
3 | 100200120201122001020121 |
4 | 1132120132220110303 |
5 | 3130022124223011 |
6 | 114320035351111 |
7 | 10215234210220 |
oct | 1363036502463 |
9 | 320521561217 |
10 | 101342414131 |
11 | 39a85172772 |
12 | 17783452497 |
13 | 973097802a |
14 | 4c95462947 |
15 | 2982006e71 |
hex | 17987a8533 |
101342414131 has 16 divisors (see below), whose sum is σ = 116763068160. Its totient is φ = 86160402720.
The previous prime is 101342414093. The next prime is 101342414167. The reversal of 101342414131 is 131414243101.
It is not a de Polignac number, because 101342414131 - 27 = 101342414003 is a prime.
It is a super-2 number, since 2×1013424141312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101342414096 and 101342414105.
It is not an unprimeable number, because it can be changed into a prime (101342414191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 308896 + ... + 545986.
It is an arithmetic number, because the mean of its divisors is an integer number (7297691760).
Almost surely, 2101342414131 is an apocalyptic number.
101342414131 is a deficient number, since it is larger than the sum of its proper divisors (15420654029).
101342414131 is a wasteful number, since it uses less digits than its factorization.
101342414131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237594.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101342414131 its reverse (131414243101), we get a palindrome (232756657232).
The spelling of 101342414131 in words is "one hundred one billion, three hundred forty-two million, four hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •