Base | Representation |
---|---|
bin | 101101110001010110001001… |
… | …100100000100011110001001 |
3 | 222101202101120020212121100220 |
4 | 231301112021210010132021 |
5 | 202341122302303132223 |
6 | 1552045214210420253 |
7 | 60254446136544441 |
oct | 5561261144043611 |
9 | 871671506777326 |
10 | 201303130130313 |
11 | 591611a5aa67a2 |
12 | 1a6b1a8ab91689 |
13 | 8842a5aa00723 |
14 | 379d1a2bab121 |
15 | 1841552bb06e3 |
hex | b71589904789 |
201303130130313 has 8 divisors (see below), whose sum is σ = 268415799370368. Its totient is φ = 134196273821904.
The previous prime is 201303130130293. The next prime is 201303130130321. The reversal of 201303130130313 is 313031031303102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201303130130313 - 213 = 201303130122121 is a prime.
It is a super-2 number, since 2×2013031301303132 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201303130130363) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1453152106 + ... + 1453290627.
It is an arithmetic number, because the mean of its divisors is an integer number (33551974921296).
Almost surely, 2201303130130313 is an apocalyptic number.
It is an amenable number.
201303130130313 is a deficient number, since it is larger than the sum of its proper divisors (67112669240055).
201303130130313 is a wasteful number, since it uses less digits than its factorization.
201303130130313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906465823.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 201303130130313 its reverse (313031031303102), we get a palindrome (514334161433415).
The spelling of 201303130130313 in words is "two hundred one trillion, three hundred three billion, one hundred thirty million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •