Base | Representation |
---|---|
bin | 11101110110101010111011… |
… | …110000001100101111011011 |
3 | 122012220012000200021011002210 |
4 | 131312222323300030233123 |
5 | 114202211003323310321 |
6 | 1143130305240130203 |
7 | 36441063561151263 |
oct | 3566527360145733 |
9 | 565805020234083 |
10 | 131300300213211 |
11 | 3892216552a008 |
12 | 12886a64a66963 |
13 | 583574692347c |
14 | 245cd7b5747a3 |
15 | 102a64ea20b76 |
hex | 776abbc0cbdb |
131300300213211 has 8 divisors (see below), whose sum is σ = 175124635876944. Its totient is φ = 87504749012480.
The previous prime is 131300300213191. The next prime is 131300300213219. The reversal of 131300300213211 is 112312003003131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131300300213211 - 29 = 131300300212699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131300300213219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7196105106 + ... + 7196123351.
It is an arithmetic number, because the mean of its divisors is an integer number (21890579484618).
Almost surely, 2131300300213211 is an apocalyptic number.
131300300213211 is a deficient number, since it is larger than the sum of its proper divisors (43824335663733).
131300300213211 is a wasteful number, since it uses less digits than its factorization.
131300300213211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14392231501.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 131300300213211 its reverse (112312003003131), we get a palindrome (243612303216342).
The spelling of 131300300213211 in words is "one hundred thirty-one trillion, three hundred billion, three hundred million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •