Base | Representation |
---|---|
bin | 10100101011100101… |
… | …01100111101010011 |
3 | 1001122210022102100221 |
4 | 22111302230331103 |
5 | 140214333443443 |
6 | 5033424253511 |
7 | 542100131062 |
oct | 122562547523 |
9 | 31583272327 |
10 | 11103031123 |
11 | 478840a688 |
12 | 219a471297 |
13 | 107c38ca02 |
14 | 7748501d9 |
15 | 44eb41eed |
hex | 295cacf53 |
11103031123 has 4 divisors (see below), whose sum is σ = 11161162368. Its totient is φ = 11044899880.
The previous prime is 11103031099. The next prime is 11103031189. The reversal of 11103031123 is 32113030111.
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 11103031123 - 25 = 11103031091 is a prime.
It is a super-2 number, since 2×111030311232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11103031097 and 11103031106.
It is not an unprimeable number, because it can be changed into a prime (11103031193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29065336 + ... + 29065717.
It is an arithmetic number, because the mean of its divisors is an integer number (2790290592).
Almost surely, 211103031123 is an apocalyptic number.
11103031123 is a deficient number, since it is larger than the sum of its proper divisors (58131245).
11103031123 is an equidigital number, since it uses as much as digits as its factorization.
11103031123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58131244.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11103031123 its reverse (32113030111), we get a palindrome (43216061234).
The spelling of 11103031123 in words is "eleven billion, one hundred three million, thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •