Base | Representation |
---|---|
bin | 111101000000011010… |
… | …0101011001101111001 |
3 | 110112011100000100210222 |
4 | 1322000310223031321 |
5 | 4121302114423113 |
6 | 140104005345425 |
7 | 12315362161400 |
oct | 1720064531571 |
9 | 415140010728 |
10 | 131010311033 |
11 | 506199a5828 |
12 | 21483108275 |
13 | c47b2b2004 |
14 | 64ab73c637 |
15 | 361b8cee08 |
hex | 1e80d2b379 |
131010311033 has 12 divisors (see below), whose sum is σ = 155275219620. Its totient is φ = 110175784992.
The previous prime is 131010311023. The next prime is 131010311083. The reversal of 131010311033 is 330113010131.
It can be written as a sum of positive squares in 2 ways, for example, as 41539331344 + 89470979689 = 203812^2 + 299117^2 .
It is not a de Polignac number, because 131010311033 - 26 = 131010310969 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131010311023) 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 11 ways as a sum of consecutive naturals, for example, 25220798 + ... + 25225991.
It is an arithmetic number, because the mean of its divisors is an integer number (12939601635).
Almost surely, 2131010311033 is an apocalyptic number.
It is an amenable number.
131010311033 is a deficient number, since it is larger than the sum of its proper divisors (24264908587).
131010311033 is an equidigital number, since it uses as much as digits as its factorization.
131010311033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50446856 (or 50446849 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 131010311033 its reverse (330113010131), we get a palindrome (461123321164).
The spelling of 131010311033 in words is "one hundred thirty-one billion, ten million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •