Base | Representation |
---|---|
bin | 10110110000101100001100… |
… | …011110001010100011010011 |
3 | 111010102202101000120102112011 |
4 | 112300230030132022203103 |
5 | 101110041432033031003 |
6 | 552522404443243351 |
7 | 30041126645541553 |
oct | 2660541436124323 |
9 | 433382330512464 |
10 | 100103012002003 |
11 | 299944a365aa2a |
12 | b288774219557 |
13 | 43b189a97ca9a |
14 | 1aa1023cc1163 |
15 | b88d9816e46d |
hex | 5b0b0c78a8d3 |
100103012002003 has 4 divisors (see below), whose sum is σ = 101512913579568. Its totient is φ = 98693110424440.
The previous prime is 100103012001959. The next prime is 100103012002039. The reversal of 100103012002003 is 300200210301001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100103012002003 - 221 = 100103009904851 is a prime.
It is a super-2 number, since 2×1001030120020032 (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 (100103022002003) 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, 704950788676 + ... + 704950788817.
It is an arithmetic number, because the mean of its divisors is an integer number (25378228394892).
Almost surely, 2100103012002003 is an apocalyptic number.
100103012002003 is a deficient number, since it is larger than the sum of its proper divisors (1409901577565).
100103012002003 is an equidigital number, since it uses as much as digits as its factorization.
100103012002003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1409901577564.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 100103012002003 its reverse (300200210301001), we get a palindrome (400303222303004).
The spelling of 100103012002003 in words is "one hundred trillion, one hundred three billion, twelve million, two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •