Base | Representation |
---|---|
bin | 100000110100001… |
… | …1000011110110001 |
3 | 2211201220221012101 |
4 | 1001220120132301 |
5 | 4223340330243 |
6 | 301132300401 |
7 | 36200144605 |
oct | 10150303661 |
9 | 2751827171 |
10 | 1101105073 |
11 | 5155aa5a2 |
12 | 268911701 |
13 | 147179983 |
14 | a6349505 |
15 | 66a0354d |
hex | 41a187b1 |
1101105073 has 2 divisors, whose sum is σ = 1101105074. Its totient is φ = 1101105072.
The previous prime is 1101105067. The next prime is 1101105127. The reversal of 1101105073 is 3705011011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1045034929 + 56070144 = 32327^2 + 7488^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101105073 - 29 = 1101104561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101105073.
It is not a weakly prime, because it can be changed into another prime (1101105373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550552536 + 550552537.
It is an arithmetic number, because the mean of its divisors is an integer number (550552537).
Almost surely, 21101105073 is an apocalyptic number.
It is an amenable number.
1101105073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101105073 is an equidigital number, since it uses as much as digits as its factorization.
1101105073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105, while the sum is 19.
The square root of 1101105073 is about 33182.9033238504. The cubic root of 1101105073 is about 1032.6256800307.
Adding to 1101105073 its reverse (3705011011), we get a palindrome (4806116084).
The spelling of 1101105073 in words is "one billion, one hundred one million, one hundred five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •