Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1000101111001100101 |
3 | 101111221002121012200101 |
4 | 1212130201011321211 |
5 | 3300240011244023 |
6 | 122311111544101 |
7 | 10642622306533 |
oct | 1463441057145 |
9 | 344832535611 |
10 | 110000103013 |
11 | 42718210549 |
12 | 1939a98b031 |
13 | a4b0534a68 |
14 | 547720d153 |
15 | 2cdc1181ad |
hex | 199c845e65 |
110000103013 has 4 divisors (see below), whose sum is σ = 111009278380. Its totient is φ = 108990927648.
The previous prime is 110000103001. The next prime is 110000103023. The reversal of 110000103013 is 310301000011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 94164900769 + 15835202244 = 306863^2 + 125838^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000103013 - 233 = 101410168421 is a prime.
It is a super-2 number, since 2×1100001030132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000103023) 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, 504587520 + ... + 504587737.
It is an arithmetic number, because the mean of its divisors is an integer number (27752319595).
Almost surely, 2110000103013 is an apocalyptic number.
It is an amenable number.
110000103013 is a deficient number, since it is larger than the sum of its proper divisors (1009175367).
110000103013 is a wasteful number, since it uses less digits than its factorization.
110000103013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1009175366.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 110000103013 its reverse (310301000011), we get a palindrome (420301103024).
The spelling of 110000103013 in words is "one hundred ten billion, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •