Base | Representation |
---|---|
bin | 111101000011011000… |
… | …0111011101001010001 |
3 | 110112102021120201211012 |
4 | 1322012300323221101 |
5 | 4122003124234131 |
6 | 140121530100305 |
7 | 12321012360446 |
oct | 1720660735121 |
9 | 415367521735 |
10 | 131109993041 |
11 | 5067019a355 |
12 | 214b057a695 |
13 | c495b43b51 |
14 | 64baa899cd |
15 | 362552052b |
hex | 1e86c3ba51 |
131109993041 has 2 divisors, whose sum is σ = 131109993042. Its totient is φ = 131109993040.
The previous prime is 131109993037. The next prime is 131109993097. The reversal of 131109993041 is 140399901131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129906180625 + 1203812416 = 360425^2 + 34696^2 .
It is a cyclic number.
It is not a de Polignac number, because 131109993041 - 22 = 131109993037 is a prime.
It is a super-2 number, since 2×1311099930412 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131109993041.
It is not a weakly prime, because it can be changed into another prime (131109993541) 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 as a sum of consecutive naturals, namely, 65554996520 + 65554996521.
It is an arithmetic number, because the mean of its divisors is an integer number (65554996521).
Almost surely, 2131109993041 is an apocalyptic number.
It is an amenable number.
131109993041 is a deficient number, since it is larger than the sum of its proper divisors (1).
131109993041 is an equidigital number, since it uses as much as digits as its factorization.
131109993041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 41.
The spelling of 131109993041 in words is "one hundred thirty-one billion, one hundred nine million, nine hundred ninety-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •