Base | Representation |
---|---|
bin | 11101110100010111101100… |
… | …110111000010110010101110 |
3 | 122012100001222010012112002211 |
4 | 131310113230313002302232 |
5 | 114142113221314113402 |
6 | 1142525522200441034 |
7 | 36423466140111400 |
oct | 3564275467026256 |
9 | 565301863175084 |
10 | 131142210301102 |
11 | 3887110a932190 |
12 | 128602a4a7917a |
13 | 582387130cc90 |
14 | 24554615d2b70 |
15 | 102649aad54d7 |
hex | 7745ecdc2cae |
131142210301102 has 96 divisors (see below), whose sum is σ = 269536910598144. Its totient is φ = 47040886065600.
The previous prime is 131142210301043. The next prime is 131142210301129. The reversal of 131142210301102 is 201103012241131.
131142210301102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6849274 + ... + 17583997.
It is an arithmetic number, because the mean of its divisors is an integer number (2807676152064).
Almost surely, 2131142210301102 is an apocalyptic number.
131142210301102 is an abundant number, since it is smaller than the sum of its proper divisors (138394700297042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131142210301102 is a wasteful number, since it uses less digits than its factorization.
131142210301102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24433694 (or 24433687 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 131142210301102 its reverse (201103012241131), we get a palindrome (332245222542233).
The spelling of 131142210301102 in words is "one hundred thirty-one trillion, one hundred forty-two billion, two hundred ten million, three hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •