Base | Representation |
---|---|
bin | 100000111100010… |
… | …0000111111100011 |
3 | 2212000212210112022 |
4 | 1001320200333203 |
5 | 4230431143433 |
6 | 301403052055 |
7 | 36251120546 |
oct | 10170407743 |
9 | 2760783468 |
10 | 1105334243 |
11 | 517a28a82 |
12 | 26a21102b |
13 | 147cca940 |
14 | a6b2a85d |
15 | 6708b698 |
hex | 41e20fe3 |
1105334243 has 4 divisors (see below), whose sum is σ = 1190359968. Its totient is φ = 1020308520.
The previous prime is 1105334227. The next prime is 1105334287. The reversal of 1105334243 is 3424335011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3424335011 = 7151 ⋅478861.
It is a cyclic number.
It is not a de Polignac number, because 1105334243 - 24 = 1105334227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1105334743) 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, 42512843 + ... + 42512868.
It is an arithmetic number, because the mean of its divisors is an integer number (297589992).
Almost surely, 21105334243 is an apocalyptic number.
1105334243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1105334243 is a deficient number, since it is larger than the sum of its proper divisors (85025725).
1105334243 is an equidigital number, since it uses as much as digits as its factorization.
1105334243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85025724.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 1105334243 is about 33246.5673867243. The cubic root of 1105334243 is about 1033.9460415408.
Adding to 1105334243 its reverse (3424335011), we get a palindrome (4529669254).
The spelling of 1105334243 in words is "one billion, one hundred five million, three hundred thirty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •