Base | Representation |
---|---|
bin | 11101110011000010001100… |
… | …100110100000111001111000 |
3 | 122012000021222202212221010121 |
4 | 131303002030212200321320 |
5 | 114134112210131321130 |
6 | 1142415420105423024 |
7 | 36414036051225154 |
oct | 3563021446407170 |
9 | 565007882787117 |
10 | 131050401042040 |
11 | 38836187a02a77 |
12 | 1284654219aa74 |
13 | 5817ccc70840c |
14 | 2450c322cc064 |
15 | 1023dc59c1d7a |
hex | 77308c9a0e78 |
131050401042040 has 32 divisors (see below), whose sum is σ = 312208308366480. Its totient is φ = 49336621568512.
The previous prime is 131050401041999. The next prime is 131050401042109. The reversal of 131050401042040 is 40240104050131.
It is a super-2 number, since 2×1310504010420402 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131050401041996 and 131050401042014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96360588322 + ... + 96360589681.
Almost surely, 2131050401042040 is an apocalyptic number.
131050401042040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131050401042040 is an abundant number, since it is smaller than the sum of its proper divisors (181157907324440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131050401042040 is a wasteful number, since it uses less digits than its factorization.
131050401042040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192721178031 (or 192721178027 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 131050401042040 its reverse (40240104050131), we get a palindrome (171290505092171).
The spelling of 131050401042040 in words is "one hundred thirty-one trillion, fifty billion, four hundred one million, forty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •