Base | Representation |
---|---|
bin | 1001001110011010000111… |
… | …0011000011111011111111 |
3 | 1022220200012022220121122121 |
4 | 2103212201303003323333 |
5 | 2312141113332144403 |
6 | 33323405103023411 |
7 | 2064550163011522 |
oct | 223464163037377 |
9 | 38820168817577 |
10 | 10143132303103 |
11 | 3260750832908 |
12 | 117998259ab67 |
13 | 5876549458b7 |
14 | 270d04762bb9 |
15 | 128ca5b3e3bd |
hex | 939a1cc3eff |
10143132303103 has 8 divisors (see below), whose sum is σ = 10824352399872. Its totient is φ = 9471308345856.
The previous prime is 10143132303097. The next prime is 10143132303119. The reversal of 10143132303103 is 30130323134101.
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 10143132303103 - 221 = 10143130205951 is a prime.
It is a super-3 number, since 3×101431323031033 (a number of 40 digits) contains 333 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 (10143132303203) 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, 2349032650 + ... + 2349036967.
It is an arithmetic number, because the mean of its divisors is an integer number (1353044049984).
Almost surely, 210143132303103 is an apocalyptic number.
10143132303103 is a deficient number, since it is larger than the sum of its proper divisors (681220096769).
10143132303103 is a wasteful number, since it uses less digits than its factorization.
10143132303103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4698069761.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10143132303103 its reverse (30130323134101), we get a palindrome (40273455437204).
The spelling of 10143132303103 in words is "ten trillion, one hundred forty-three billion, one hundred thirty-two million, three hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •