Base | Representation |
---|---|
bin | 10111011011000000110000… |
… | …101011010111011110110011 |
3 | 111111201210012110200021210002 |
4 | 113123000300223113132303 |
5 | 102000214131422131003 |
6 | 1003030424340100215 |
7 | 30461215230316550 |
oct | 2733006053273663 |
9 | 444653173607702 |
10 | 103011312302003 |
11 | 2a905941327876 |
12 | b67834809466b |
13 | 4562c044b7871 |
14 | 1b61aba271a27 |
15 | bd98621e1a88 |
hex | 5db030ad77b3 |
103011312302003 has 8 divisors (see below), whose sum is σ = 117778466674272. Its totient is φ = 88256971083456.
The previous prime is 103011312301973. The next prime is 103011312302021. The reversal of 103011312302003 is 300203213110301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103011312302003 - 214 = 103011312285619 is a prime.
It is a super-2 number, since 2×1030113123020032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103011312302083) 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, 3203271200 + ... + 3203303357.
It is an arithmetic number, because the mean of its divisors is an integer number (14722308334284).
Almost surely, 2103011312302003 is an apocalyptic number.
103011312302003 is a deficient number, since it is larger than the sum of its proper divisors (14767154372269).
103011312302003 is an equidigital number, since it uses as much as digits as its factorization.
103011312302003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6406576861.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 103011312302003 its reverse (300203213110301), we get a palindrome (403214525412304).
The spelling of 103011312302003 in words is "one hundred three trillion, eleven billion, three hundred twelve million, three hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •