Base | Representation |
---|---|
bin | 110000000100110011… |
… | …1010101110100000011 |
3 | 100212111000020222010111 |
4 | 1200021213111310003 |
5 | 3142414033214021 |
6 | 115232242412151 |
7 | 10313252652313 |
oct | 1401147256403 |
9 | 325430228114 |
10 | 103240523011 |
11 | 3a869646a9a |
12 | 18013061057 |
13 | 9973c98b92 |
14 | 4dd5597443 |
15 | 2a4398e8e1 |
hex | 18099d5d03 |
103240523011 has 4 divisors (see below), whose sum is σ = 104154156072. Its totient is φ = 102326889952.
The previous prime is 103240522969. The next prime is 103240523047. The reversal of 103240523011 is 110325042301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110325042301 = 47459 ⋅2324639.
It is a cyclic number.
It is not a de Polignac number, because 103240523011 - 29 = 103240522499 is a prime.
It is a super-2 number, since 2×1032405230112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103240523081) 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, 456816361 + ... + 456816586.
It is an arithmetic number, because the mean of its divisors is an integer number (26038539018).
Almost surely, 2103240523011 is an apocalyptic number.
103240523011 is a deficient number, since it is larger than the sum of its proper divisors (913633061).
103240523011 is an equidigital number, since it uses as much as digits as its factorization.
103240523011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 913633060.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 103240523011 its reverse (110325042301), we get a palindrome (213565565312).
The spelling of 103240523011 in words is "one hundred three billion, two hundred forty million, five hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •