Base | Representation |
---|---|
bin | 110001011011001111… |
… | …1110011110100011011 |
3 | 101010222011000211100021 |
4 | 1202312133303310123 |
5 | 3214334044212011 |
6 | 120432134051311 |
7 | 10445162450245 |
oct | 1426637636433 |
9 | 333864024307 |
10 | 106141007131 |
11 | 41017916705 |
12 | 186a24a9b37 |
13 | a016b79083 |
14 | 51cc897095 |
15 | 2b63427471 |
hex | 18b67f3d1b |
106141007131 has 16 divisors (see below), whose sum is σ = 111470220288. Its totient is φ = 100871892000.
The previous prime is 106141007129. The next prime is 106141007207. The reversal of 106141007131 is 131700141601.
It is a cyclic number.
It is not a de Polignac number, because 106141007131 - 21 = 106141007129 is a prime.
It is a super-2 number, since 2×1061410071312 (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 = 106141007096 and 106141007105.
It is not an unprimeable number, because it can be changed into a prime (106141037131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10715281 + ... + 10725181.
It is an arithmetic number, because the mean of its divisors is an integer number (6966888768).
Almost surely, 2106141007131 is an apocalyptic number.
106141007131 is a deficient number, since it is larger than the sum of its proper divisors (5329213157).
106141007131 is a wasteful number, since it uses less digits than its factorization.
106141007131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12882.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 106141007131 its reverse (131700141601), we get a palindrome (237841148732).
The spelling of 106141007131 in words is "one hundred six billion, one hundred forty-one million, seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •