Base | Representation |
---|---|
bin | 10101001111010110… |
… | …11111010011110111 |
3 | 1002102201000000202222 |
4 | 22213223133103313 |
5 | 141323200130403 |
6 | 5123304352555 |
7 | 552403002161 |
oct | 124753372367 |
9 | 32381000688 |
10 | 11403130103 |
11 | 4921851472 |
12 | 2262a7575b |
13 | 10c95c3881 |
14 | 7a264b931 |
15 | 46b170338 |
hex | 2a7adf4f7 |
11403130103 has 8 divisors (see below), whose sum is σ = 12191126688. Its totient is φ = 10628158464.
The previous prime is 11403130093. The next prime is 11403130129. The reversal of 11403130103 is 30103130411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-11403130103 is a prime.
It is a super-2 number, since 2×114031301032 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11403130133) 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 7 ways as a sum of consecutive naturals, for example, 3254426 + ... + 3257927.
It is an arithmetic number, because the mean of its divisors is an integer number (1523890836).
Almost surely, 211403130103 is an apocalyptic number.
11403130103 is a deficient number, since it is larger than the sum of its proper divisors (787996585).
11403130103 is a wasteful number, since it uses less digits than its factorization.
11403130103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6512473.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11403130103 its reverse (30103130411), we get a palindrome (41506260514).
The spelling of 11403130103 in words is "eleven billion, four hundred three million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •