Base | Representation |
---|---|
bin | 11101110010011110101000… |
… | …111001100110100001111011 |
3 | 122011212122102221121000210210 |
4 | 131302132220321212201323 |
5 | 114133001012100232303 |
6 | 1142350103345042203 |
7 | 36411214654131210 |
oct | 3562365071464173 |
9 | 564778387530723 |
10 | 131012221102203 |
11 | 38820a75370091 |
12 | 1283b067926363 |
13 | 581452674a83c |
14 | 244d04d739b07 |
15 | 1022dddba7203 |
hex | 7727a8e6687b |
131012221102203 has 64 divisors (see below), whose sum is σ = 206690950222848. Its totient is φ = 72259951841280.
The previous prime is 131012221102193. The next prime is 131012221102223. The reversal of 131012221102203 is 302201122210131.
It is not a de Polignac number, because 131012221102203 - 212 = 131012221098107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 131012221102203.
It is not an unprimeable number, because it can be changed into a prime (131012221102223) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 68800851 + ... + 70679427.
It is an arithmetic number, because the mean of its divisors is an integer number (3229546097232).
Almost surely, 2131012221102203 is an apocalyptic number.
131012221102203 is a deficient number, since it is larger than the sum of its proper divisors (75678729120645).
131012221102203 is a wasteful number, since it uses less digits than its factorization.
131012221102203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1879492.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 131012221102203 its reverse (302201122210131), we get a palindrome (433213343312334).
The spelling of 131012221102203 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-one million, one hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •