Base | Representation |
---|---|
bin | 10010111100110001001… |
… | …111110010011101001101 |
3 | 11121111012122111202010000 |
4 | 102330301033302131031 |
5 | 132313402014004401 |
6 | 2434120101234513 |
7 | 163036522350003 |
oct | 22746117623515 |
9 | 4544178452100 |
10 | 1302201313101 |
11 | 462295769317 |
12 | 190460702a39 |
13 | 95a49198680 |
14 | 47053a88a73 |
15 | 23d17301186 |
hex | 12f313f274d |
1302201313101 has 160 divisors (see below), whose sum is σ = 2198780559360. Its totient is φ = 762575990400.
The previous prime is 1302201313057. The next prime is 1302201313103. The reversal of 1302201313101 is 1013131022031.
1302201313101 is a `hidden beast` number, since 1 + 3 + 0 + 220 + 131 + 310 + 1 = 666.
It is not a de Polignac number, because 1302201313101 - 213 = 1302201304909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302201313103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 647538186 + ... + 647540196.
It is an arithmetic number, because the mean of its divisors is an integer number (13742378496).
Almost surely, 21302201313101 is an apocalyptic number.
It is an amenable number.
1302201313101 is a deficient number, since it is larger than the sum of its proper divisors (896579246259).
1302201313101 is a wasteful number, since it uses less digits than its factorization.
1302201313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2389 (or 2380 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1302201313101 its reverse (1013131022031), we get a palindrome (2315332335132).
The spelling of 1302201313101 in words is "one trillion, three hundred two billion, two hundred one million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •