Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …0001010010000110111001 |
3 | 1201102111101121100012111121 |
4 | 2332303200301102012321 |
5 | 3204311344331444001 |
6 | 43515324053225241 |
7 | 2522211601203424 |
oct | 276634061220671 |
9 | 51374347305447 |
10 | 13112011203001 |
11 | 41a5855549447 |
12 | 1579242032221 |
13 | 7415c3a52969 |
14 | 3348a637c9bb |
15 | 17b1181066a1 |
hex | bece0c521b9 |
13112011203001 has 2 divisors, whose sum is σ = 13112011203002. Its totient is φ = 13112011203000.
The previous prime is 13112011202993. The next prime is 13112011203041. The reversal of 13112011203001 is 10030211021131.
It is a happy number.
13112011203001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11800015063225 + 1311996139776 = 3435115^2 + 1145424^2 .
It is a cyclic number.
It is not a de Polignac number, because 13112011203001 - 23 = 13112011202993 is a prime.
It is not a weakly prime, because it can be changed into another prime (13112011203041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556005601500 + 6556005601501.
It is an arithmetic number, because the mean of its divisors is an integer number (6556005601501).
Almost surely, 213112011203001 is an apocalyptic number.
It is an amenable number.
13112011203001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112011203001 is an equidigital number, since it uses as much as digits as its factorization.
13112011203001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 13112011203001 its reverse (10030211021131), we get a palindrome (23142222224132).
The spelling of 13112011203001 in words is "thirteen trillion, one hundred twelve billion, eleven million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •