Base | Representation |
---|---|
bin | 11101001100101011111… |
… | …01001000100101011111 |
3 | 10112220112202002121201210 |
4 | 32212111331020211133 |
5 | 112414120230223403 |
6 | 2044514503435503 |
7 | 132324205410000 |
oct | 16462575104537 |
9 | 3486482077653 |
10 | 1003243211103 |
11 | 357522702451 |
12 | 142528155b93 |
13 | 737b4186673 |
14 | 367b307d1a7 |
15 | 1b16b34cb03 |
hex | e995f4895f |
1003243211103 has 20 divisors (see below), whose sum is σ = 1560507707608. Its totient is φ = 573281830800.
The previous prime is 1003243211093. The next prime is 1003243211107. The reversal of 1003243211103 is 3011123423001.
It is not a de Polignac number, because 1003243211103 - 25 = 1003243211071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1003243211103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003243211107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 69633448 + ... + 69647853.
Almost surely, 21003243211103 is an apocalyptic number.
1003243211103 is a deficient number, since it is larger than the sum of its proper divisors (557264496505).
1003243211103 is an frugal number, since it uses more digits than its factorization.
1003243211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139281332 (or 139281311 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1003243211103 its reverse (3011123423001), we get a palindrome (4014366634104).
The spelling of 1003243211103 in words is "one trillion, three billion, two hundred forty-three million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •