Base | Representation |
---|---|
bin | 1011110101010010110001… |
… | …0111100001010111111111 |
3 | 1201001202121020011121121022 |
4 | 2331110230113201113333 |
5 | 3201124342234144403 |
6 | 43400445320254355 |
7 | 2511645614632403 |
oct | 275245427412777 |
9 | 51052536147538 |
10 | 13010200303103 |
11 | 416665a994463 |
12 | 15615699113bb |
13 | 734b1a007b23 |
14 | 32d9a8a09103 |
15 | 178659e0dd38 |
hex | bd52c5e15ff |
13010200303103 has 8 divisors (see below), whose sum is σ = 13379385616080. Its totient is φ = 12641939110080.
The previous prime is 13010200303091. The next prime is 13010200303117. The reversal of 13010200303103 is 30130300201031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13010200303103 - 210 = 13010200302079 is a prime.
It is a super-2 number, since 2×130102003031032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13010200303123) 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, 231001433 + ... + 231057746.
It is an arithmetic number, because the mean of its divisors is an integer number (1672423202010).
Almost surely, 213010200303103 is an apocalyptic number.
13010200303103 is a deficient number, since it is larger than the sum of its proper divisors (369185312977).
13010200303103 is an equidigital number, since it uses as much as digits as its factorization.
13010200303103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462059977.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13010200303103 its reverse (30130300201031), we get a palindrome (43140500504134).
The spelling of 13010200303103 in words is "thirteen trillion, ten billion, two hundred million, three hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •