Base | Representation |
---|---|
bin | 11101110010110000010110… |
… | …100000111111010101000010 |
3 | 122011221110112102000210211220 |
4 | 131302300112200333111002 |
5 | 114133303434420404442 |
6 | 1142402530510215510 |
7 | 36412460164166121 |
oct | 3562602640772502 |
9 | 564843472023756 |
10 | 131031240013122 |
11 | 38829045012389 |
12 | 128428951b4596 |
13 | 5816267aa9a97 |
14 | 244dd355d7ab8 |
15 | 1023653729eec |
hex | 772c1683f542 |
131031240013122 has 16 divisors (see below), whose sum is σ = 263206857671040. Its totient is φ = 43486350396912.
The previous prime is 131031240013111. The next prime is 131031240013129. The reversal of 131031240013122 is 221310042130131.
It is a junction number, because it is equal to n+sod(n) for n = 131031240013092 and 131031240013101.
It is not an unprimeable number, because it can be changed into a prime (131031240013129) 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 7 ways as a sum of consecutive naturals, for example, 47682400378 + ... + 47682403125.
It is an arithmetic number, because the mean of its divisors is an integer number (16450428604440).
Almost surely, 2131031240013122 is an apocalyptic number.
131031240013122 is an abundant number, since it is smaller than the sum of its proper divisors (132175617657918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131031240013122 is a wasteful number, since it uses less digits than its factorization.
131031240013122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95364803737.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 131031240013122 its reverse (221310042130131), we get a palindrome (352341282143253).
The spelling of 131031240013122 in words is "one hundred thirty-one trillion, thirty-one billion, two hundred forty million, thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •