Base | Representation |
---|---|
bin | 10111011101110000011111… |
… | …111101000110101001100011 |
3 | 111112101211021011020210011211 |
4 | 113131300133331012221203 |
5 | 102011312110114100003 |
6 | 1003253232533050551 |
7 | 30510645313662451 |
oct | 2735603775065143 |
9 | 445354234223154 |
10 | 103200010300003 |
11 | 2a978973439651 |
12 | b6a8a2a786a57 |
13 | 4577947160296 |
14 | 1b6ac9b30b9d1 |
15 | bde70831e96d |
hex | 5ddc1ff46a63 |
103200010300003 has 4 divisors (see below), whose sum is σ = 103214250684000. Its totient is φ = 103185769916008.
The previous prime is 103200010299977. The next prime is 103200010300007. The reversal of 103200010300003 is 300003010002301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103200010300003 is a prime.
It is a super-4 number, since 4×1032000103000034 (a number of 57 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103200010300007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7120181128 + ... + 7120195621.
It is an arithmetic number, because the mean of its divisors is an integer number (25803562671000).
Almost surely, 2103200010300003 is an apocalyptic number.
103200010300003 is a deficient number, since it is larger than the sum of its proper divisors (14240383997).
103200010300003 is an equidigital number, since it uses as much as digits as its factorization.
103200010300003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14240383996.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 103200010300003 its reverse (300003010002301), we get a palindrome (403203020302304).
The spelling of 103200010300003 in words is "one hundred three trillion, two hundred billion, ten million, three hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •