Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …101110010001101011001 |
3 | 10220021101121121202012020 |
4 | 100001210231302031121 |
5 | 121020230021222023 |
6 | 2201515050405053 |
7 | 142362540022044 |
oct | 20014455621531 |
9 | 3807347552166 |
10 | 1101201351513 |
11 | 39502050018a |
12 | 159506130789 |
13 | 7cac5953963 |
14 | 3b426c69c5b |
15 | 1d9a11a6de3 |
hex | 10064b72359 |
1101201351513 has 32 divisors (see below), whose sum is σ = 1678169145600. Its totient is φ = 638118598656.
The previous prime is 1101201351499. The next prime is 1101201351527. The reversal of 1101201351513 is 3151531021011.
It is an interprime number because it is at equal distance from previous prime (1101201351499) and next prime (1101201351527).
It is not a de Polignac number, because 1101201351513 - 26 = 1101201351449 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1101201351113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16152028 + ... + 16220061.
It is an arithmetic number, because the mean of its divisors is an integer number (52442785800).
Almost surely, 21101201351513 is an apocalyptic number.
It is an amenable number.
1101201351513 is a deficient number, since it is larger than the sum of its proper divisors (576967794087).
1101201351513 is a wasteful number, since it uses less digits than its factorization.
1101201351513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32372161.
The product of its (nonzero) digits is 450, while the sum is 24.
Adding to 1101201351513 its reverse (3151531021011), we get a palindrome (4252732372524).
The spelling of 1101201351513 in words is "one trillion, one hundred one billion, two hundred one million, three hundred fifty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •