Base | Representation |
---|---|
bin | 11101110011110001011011… |
… | …110000101001010101110001 |
3 | 122012012010220112212000221100 |
4 | 131303301123300221111301 |
5 | 114140430044013101001 |
6 | 1142455005035115013 |
7 | 36420512666521020 |
oct | 3563613360512561 |
9 | 565163815760840 |
10 | 131101121222001 |
11 | 38855745148977 |
12 | 128543382a2a69 |
13 | 581ca23731818 |
14 | 245348452a8b7 |
15 | 10253936c3586 |
hex | 773c5bc29571 |
131101121222001 has 48 divisors (see below), whose sum is σ = 217383013785600. Its totient is φ = 74582049767904.
The previous prime is 131101121221999. The next prime is 131101121222033. The reversal of 131101121222001 is 100222121101131.
It is a happy number.
131101121222001 is a `hidden beast` number, since 131 + 101 + 1 + 212 + 220 + 0 + 1 = 666.
It is not a de Polignac number, because 131101121222001 - 21 = 131101121221999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131101121227001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56792620 + ... + 59055938.
It is an arithmetic number, because the mean of its divisors is an integer number (4528812787200).
Almost surely, 2131101121222001 is an apocalyptic number.
It is an amenable number.
131101121222001 is a deficient number, since it is larger than the sum of its proper divisors (86281892563599).
131101121222001 is a wasteful number, since it uses less digits than its factorization.
131101121222001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2267418 (or 2267415 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 131101121222001 its reverse (100222121101131), we get a palindrome (231323242323132).
The spelling of 131101121222001 in words is "one hundred thirty-one trillion, one hundred one billion, one hundred twenty-one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •