Base | Representation |
---|---|
bin | 11101110101001111100101… |
… | …001100011101110110110111 |
3 | 122012112210211200120002200212 |
4 | 131311033211030131312313 |
5 | 114144104112034211044 |
6 | 1143013244101100035 |
7 | 36431022050513444 |
oct | 3565174514356667 |
9 | 565483750502625 |
10 | 131202211241399 |
11 | 388945aa8a1751 |
12 | 1286ba4b0b761b |
13 | 582941400914c |
14 | 245831424c9cb |
15 | 1027d0d471a9e |
hex | 7753e531ddb7 |
131202211241399 has 16 divisors (see below), whose sum is σ = 150183771228000. Its totient is φ = 113823489752064.
The previous prime is 131202211241389. The next prime is 131202211241527. The reversal of 131202211241399 is 993142112202131.
It is a cyclic number.
It is not a de Polignac number, because 131202211241399 - 24 = 131202211241383 is a prime.
It is a super-2 number, since 2×1312022112413992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131202211241389) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5489160974 + ... + 5489184875.
It is an arithmetic number, because the mean of its divisors is an integer number (9386485701750).
Almost surely, 2131202211241399 is an apocalyptic number.
131202211241399 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
131202211241399 is a deficient number, since it is larger than the sum of its proper divisors (18981559986601).
131202211241399 is a wasteful number, since it uses less digits than its factorization.
131202211241399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10978345922.
The product of its (nonzero) digits is 46656, while the sum is 41.
The spelling of 131202211241399 in words is "one hundred thirty-one trillion, two hundred two billion, two hundred eleven million, two hundred forty-one thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •