Base | Representation |
---|---|
bin | 11101110101010111110111… |
… | …000000011000111101100101 |
3 | 122012120122210011022211100010 |
4 | 131311113313000120331211 |
5 | 114144230313100000401 |
6 | 1143021314110040433 |
7 | 36431455242643032 |
oct | 3565276700307545 |
9 | 565518704284303 |
10 | 131211100000101 |
11 | 38898351313720 |
12 | 1287170baa9119 |
13 | 582a1cc70b094 |
14 | 2458918988389 |
15 | 102817d9c7ed6 |
hex | 7755f7018f65 |
131211100000101 has 16 divisors (see below), whose sum is σ = 199150444270080. Its totient is φ = 76064405796720.
The previous prime is 131211100000061. The next prime is 131211100000103. The reversal of 131211100000101 is 101000001112131.
It is not a de Polignac number, because 131211100000101 - 211 = 131211099998053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211100000103) 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, 86436824011 + ... + 86436825528.
It is an arithmetic number, because the mean of its divisors is an integer number (12446902766880).
Almost surely, 2131211100000101 is an apocalyptic number.
131211100000101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131211100000101 is a deficient number, since it is larger than the sum of its proper divisors (67939344269979).
131211100000101 is a wasteful number, since it uses less digits than its factorization.
131211100000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172873649576.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 131211100000101 its reverse (101000001112131), we get a palindrome (232211101112232).
The spelling of 131211100000101 in words is "one hundred thirty-one trillion, two hundred eleven billion, one hundred million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •